222
click to vote
STOC
16 years 7 months ago
2004 ACM 
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
209
click to vote
STOC
16 years 7 months ago
2004 ACM 
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
201
click to vote
STOC
16 years 7 months ago
2004 ACM 
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
197
Voted
STOC
16 years 7 months ago
2004 ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
194
click to vote
STOC
16 years 3 days ago
2004 ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
|
Algorithms