An information statistics approach to data stream and communication complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 209-218

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

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; SET THEORY; THEOREM PROVING;

COMMUNICATION COMPLEXITY; DATA STREAM; INFORMATION STATISTICS;

INFORMATION THEORY;

EID: 0036953748     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. L. Ablayev, Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 157(2):139-159, 1996.
2. M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 370-379, 2002.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory (preliminary version). In Proceedings of the 27th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 337-347, 1986.
5. R. E. Bryant. Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers, 35:677-691, 1986.
6. A. Chakrabarti, Y. Shi, A. Wirth, and A. C.-C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 270-278, 2001.
7. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
8. 1-difference algorithm for massive data streams. In Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 501-511, 1999.
9. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 389-398, 2002.
10. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 359-366, 2000.
11. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computations. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 189-197, 2000.
12. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Math, 5(5):545-557, 1992.
13. M. Karchmer, R. Raz, and A. Wigderson. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Computational Complexity, 5(3/4):191-204, 1995.
14. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
15. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
16. L. Le Cam and G. L. Yang. Asymptotics in Statistics - Some Basic Concepts, pages 24-30. Springer-Verlag, 1990.
17. J. Lin. Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory, 37(1):145-151, 1991.
18. N. Nisan and I. Segal. The communication complexity of efficient allocation problems. In DIMACS workshop on Computational Issues in Game Theory and Mechanism Design, 2001.
19. C. H. Papadimitriou and M. Sipser. Communication complexity. Journal of Computer and System Sciences, 28(2):260-269, 1984.
20. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
21. A. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.
22. A. Rényi. On measures of entropy and information. In Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, pages 547-561, 1960.
23. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 360-369, 2002.
24. I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science. John Wiley & Sons, 1987.
25. A. C.-C. Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), pages 209-213, 1979.