Sciweavers

159
Voted
STOC
1991
ACM
167views Algorithms» more  STOC 1991»
15 years 6 months ago
Counting Networks and Multi-Processor Coordination
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
James Aspnes, Maurice Herlihy, Nir Shavit
149
Voted
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 6 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
120
Voted
STOC
1991
ACM
85views Algorithms» more  STOC 1991»
15 years 6 months ago
On Deterministic Approximation of DNF
Michael Luby, Boban Velickovic
118
Voted
STOC
1991
ACM
127views Algorithms» more  STOC 1991»
15 years 6 months ago
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
117
Voted
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 6 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
Algorithms
Top of PageReset Settings