Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Communication Complexity for Asynchronous Systems of Finite Devices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Communication Gap for Finite Memory Devices
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Computational Complexity
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
This 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 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.