On data structures and asymmetric communication complexity (original) (raw)
Related papers
Lower bounds on communication complexity
Information and Computation, 1987
Lower bounds on information complexity via zero-communication protocols and applications
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 2012
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013
Communication Complexity of Simultaneous Messages
Siam Journal on Computing, 2003
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, 1998
Algebraic techniques in communication complexity
Luciano Margara, Bruno Codenotti
Information Processing Letters, 1995
The Cell Probe Complexity of Succinct Data Structures
2003
2008
Lower bounds on information complexity
2014
On multi-partition communication complexity
Information and Computation, 2004
The Communication Complexity of Enumeration, Elimination, and Selection
Bala Kalyanasundaram, William Gasarch, Leen Torenvliet
Journal of Computer and System Sciences, 2001
Contributions to Structural Communication Complexity
2009
Direct Sum Questions in Classical Communication Complexity
2012
Traced communication complexity
2016
Communication complexity towards lower bounds on circuit depth
2002
A note on a problem in communication complexity
2012
Lower bounds in communication complexity based on factorization norms
Random Structures and Algorithms, 2009
A Direct Sum Theorem in Communication Complexity via Message Compression
Computing Research Repository, 2003
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Lecture Notes in Computer Science, 2006
2019
The communication complexity of the Exact-N Problem revisited
2005
A Note on Non-Deterministic Communication Complexity with Few Witnesses
Theory of Computing Systems, 2003
The communication complexity of non-signaling distributions
julien degorre, Jérémie Roland
34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09), 2009
Results on communication complexity classes
2003
The power of randomness for communication complexity
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87