Jump to Content
View Cart
Logged Out Log In
SIAM J. Comput. 23, pp. 652-661 (10 pages)
Communication-Space Tradeoffs for Unrestricted Protocols
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookThis paper introduces communicating branching programs and develops a general technique for demonstrating communication-space tradeoffs for pairs of communicating branching programs. This technique is then used to prove communication-space tradeoffs for any pair of communicating branching programs that hashes according to a universal family of hash functions. Other tradeoffs follow from this result. As an example, any pair of communicating Boolean branching programs that computes matrix-vector products over ${\text{GF}}(2)$ requires communication-space product $\Omega (n^2 )$, provided the space used is $o({n / {\log n}})$. These are the first examples of communication-space tradeoffs on a completely general model of communicating processes.
© 1994 © Society for Industrial and Applied Mathematics
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received October 01, 1992
Accepted February 17, 1993
Accepted February 17, 1993
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar