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 Academic Press

• Type: Conference
• Year: 1995
• Where: STOC
• Authors: Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
• Keywords: Algorithms, Communication Case, Lower Bound Proofs, Round Reduction, STOC 1995