Lower bounds on communication complexity (original) (raw)
Related papers
Lower bounds on information complexity via zero-communication protocols and applications
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 2012
On multi-partition communication complexity
Information and Computation, 2004
Communication Complexity of Simultaneous Messages
Siam Journal on Computing, 2003
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013
On the complexity of interactive proofs with bounded communication
Information Processing Letters
Results on communication complexity classes
2003
The Communication Complexity of Enumeration, Elimination, and Selection
Bala Kalyanasundaram, William Gasarch, Leen Torenvliet
Journal of Computer and System Sciences, 2001
On data structures and asymmetric communication complexity
1995
A Direct Sum Theorem in Communication Complexity via Message Compression
Computing Research Repository, 2003
Languages with Bounded Multiparty Communication Complexity
Lecture Notes in Computer Science, 2007
A note on a problem in communication complexity
2012
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, 1998
2019
Relations between communication complexity classes
Journal of Computer and System Sciences, 1990
On Toda’s Theorem in Structural Communication Complexity
Lecture Notes in Computer Science, 2009
Lecture Notes in Computer Science, 1993
2008
Infinite Communication Complexity
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
ArXiv, 2020
On the communication complexity of zero-knowledge proofs
Journal of Cryptology, 1993
The power of randomness for communication complexity
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
Algebraic techniques in communication complexity
Luciano Margara, Bruno Codenotti
Information Processing Letters, 1995
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Lecture Notes in Computer Science, 2006
Communication versus Computation
IEEE Micro, 2004
A Note on Non-Deterministic Communication Complexity with Few Witnesses
Theory of Computing Systems, 2003