126
click to vote
STOC
16 years 18 days 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, ...
113
Voted
STOC
16 years 18 days 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...
111
click to vote
STOC
16 years 18 days 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...
115
click to vote
STOC
16 years 18 days 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...
STOC
16 years 18 days ago
2004 ACM 
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
|
Algorithms