Sciweavers

72
Voted
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 10 days 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...