72 search results - page 7 / 15 » stoc 2003 |
STOC
2001
ACM
16 years 6 days ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
101
click to vote
STOC
2003
ACM
16 years 6 days ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
STOC
2003
ACM
16 years 6 days ago
2003
ACM
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...