Sciweavers

39 search results - page 3 / 8
» stoc 1998
Sort
View
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
13 years 9 months ago
Adaptive Packet Routing for Bursty Adversarial Traffic
William Aiello, Eyal Kushilevitz, Rafail Ostrovsky...
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
13 years 9 months ago
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
13 years 9 months ago
The Power of a Pebble: Exploring and Mapping Directed Graphs
Michael A. Bender, Antonio Fernández, Dana ...
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
13 years 8 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...