Sciweavers

STOC
1991
ACM
167views Algorithms» more  STOC 1991»
15 years 7 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
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 7 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
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 7 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
131
Voted
STOC
1991
ACM
85views Algorithms» more  STOC 1991»
15 years 7 months ago
On Deterministic Approximation of DNF
Michael Luby, Boban Velickovic
130
Voted
STOC
1991
ACM
163views Algorithms» more  STOC 1991»
15 years 7 months ago
Clique Partitions, Graph Compression, and Speeding-Up Algorithms
Tomás Feder, Rajeev Motwani
Algorithms
Top of PageReset Settings