Proceedings  31st Annual Symposium on Foundations of Computer Science (1990)
St. Louis, MO, USA
Oct. 22, 1990 to Oct. 24, 1990
pp: 420-428 vol.1
P. Beame , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
M. Tompa , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
Communicating branching programs are introduced, and a general technique for demonstrating communication-space tradeoffs for pairs of communicating branching programs is developed. The technique is 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. For example any pair of communicating Boolean branching programs that computes matrix-vector products over GF(2) requires communication-space product Omega (n/sup 2/). These are the first examples of communication-space tradeoffs on a completely general model of communicating processes.
matrix-vector products, communicating branching programs, unrestricted protocols, communication-space tradeoffs, hashes, hash functions
P. Beame, P. Yan and M. Tompa, "Communication-space tradeoffs for unrestricted protocols," Proceedings  31st Annual Symposium on Foundations of Computer Science(FOCS), St. Louis, MO, USA, 1990, pp. 420-428 vol.1.