Information transfer under different sets of protocols
SIAM Journal on Computing
Information Transfer in Distributed Computing with Applications to VLSI
Journal of the ACM (JACM)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Two messages are almost optimal for conveying information
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We prove the following four results on communication complexity: 1) For every k ≥ 2, the language Lk of encodings of directed graphs of out degree one that contain a path of length k+1 from the first vertex to the last vertex and can be recognized by exchanging O(k log n) bits using a simple k-round protocol requires exchanging &Ohgr;(n1/2/k4log3n) bits if any (k−1)- round protocol is used. 2) For every k ≥ 1 and for infinitely many n ≥ 1, there exists a collection of sets Lnk @@@@ {0,1}2n that can be recognized by exchanging O(k log n) bits using a k-round protocol, and any (k−1)-round protocol recognizing Lnk requires exchanging &Ohgr;(n/k) bits. 3) Given a set L @@@@ {0,1}2n, there is a set L@@@@{0,1}8n such that any (k-round) protocol recognizing L@@@@ can be transformed to a (k-round) fixed partition protocol recognizing L with the same communication complexity, and vice versa. 4) For every integer function f, 1 ≤f(n) ≤ n, there are languages recognized by a one round deterministic protocol exchanging f(n) bits, but not by any nondeterministic protocol exchanging f(n)−1 bits. The first two results show in an incomparable way an exponential gap between (k−1)-round and k-round protocols, settling a conjecture by Papadimitriou and Sipser. The third result shows that as long as we are interested in existence proofs, a fixed partition of the input is not a restriction. The fourth result extends a result by Papadimitriou and Sipser who showed that for every integer function f, 1 ≤ f(n) ≤ n, there is a language accepted by a deterministic protocol exchanging f(n) bits but not by any deterministic protocol exchanging f(n) − 1 bits.