Information theory methods in communication complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 93-102

  Bar Yossef, Ziv ^a   Jayram, T S ^b   Kumar, Ravi ^b   Sivakumar, D ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036287241     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2002.1004344     Document Type: Article

References (26)

1. Lower bounds for one-way probabilistic communication complexity and their application to space complexity
2. The space complexity of approximating the frequency moments
3. Simultaneous messages vs. communication
4. Learnability and the Vapnik-Chervonenkis dimension
5. Time space tradeoffs (getting closer to the barrier?)
6. Informational complexity and the direct sum problem for simultaneous message complexity
7. Multi-party protocols
8. 1-difference algorithm for massive data streams
9. Non-negative entropy measures of multivariate symmetric correlations
10. Computing on data streams
11. The probabilistic communication complexity of set intersection
12. On randomized one-round communication complexity
13. On data structures and asymmetric communication
14. Rounds in communication complexity revisited
15. The communication complexity of pointer chasing Applications of entropy and sampling
16. Boolean circuits, tensor ranks and communication complexity
17. On the distributional complexity of disjointness
18. Space lower bounds for distance approximation in the data stream model
19. On the uniform convergence of relative frequencies of events to their probabilities
20. Some complexity questions related to distributed computing
21. Lower bounds by probabilistic arguments