Information transfer under different sets of protocols
SIAM Journal on Computing
Communication complexity of computing the Hamming distance
SIAM Journal on Computing
Some complexity aspects of VLSI computations, part 1
Computers and Artificial Intelligence
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Lower bounds for synchronous circuits and planar circuits
Information Processing Letters
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Private vs. common random bits in communication complexity
Information Processing Letters
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
Information and Computation
On the power of multiple reads in a chip
Information and Computation
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Distributional Complexity of Disjontness
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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 '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
A complexity theory for VLSI
Lower bounds on information transfer in distributed computations
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Meanders, Ramsey theory and lower bounds for branching programs
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Theoretical Computer Science
| Hi-index | 0.00 |
There are very few computing models for which the power of randomized computing is as well understood as for communication protocols and their communication complexity. Since the communication complexity is strongly related to several complexity measures of distinct basic models of computation, there exist possibilities to transform some results about randomized communication protocols to other computing models, and so communication complexity has established itself as a powerful instrument for the study of randomization in complexity theory. The aim of this work is to survey the fundamental results about randomized communication complexity with the focus on the comparison of the efficiency of deterministic, nondeterministic and randomized communication.