On data structures and asymmetric communication complexity

13 years 8 months ago

Download www.daimi.au.dk

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

Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi

Real-time Traffic

Algorithms | Communication Case | Lower Bound Proofs | Round Reduction | STOC 1995 |

claim paper

» Production in a Multimodal Corpus how Speakers Communicate Complex Actions

» Data Structure Optimization of ASPATH in BGP

» Lower bounds for predecessor searching in the cell probe model

» A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complex...

» Optimizing MPI collective communication by orthogonal structures

» Specifying Complex and Structured Systems with Evolving Algebras

» Data Communication and Parallel Computing on Twisted Hypercubes

» The CDAG A Data Structure for Automatic Parallelization for a Multithreaded Architecture

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STOC
Authors	Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson

Comments (0)

Sciweavers

On data structures and asymmetric communication complexity

Algorithms | Communication Case | Lower Bound Proofs | Round Reduction | STOC 1995 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers