From information to exact communication

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 151-160

  Braverman, Mark ^a   Garg, Ankit ^a   Pankratov, Denis ^b   Weinstein, Omri ^a  

^a Princeton University   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Communication complexity; Disjointness; Information complexity

Indexed keywords

ASYMPTOTICALLY OPTIMAL; COMMUNICATION COMPLEXITY; COMMUNICATION PROBLEMS; DISJOINTNESS; EXTERNAL INFORMATIONS; INFORMATION COMPLEXITY; RATE OF CONVERGENCE; UPPER AND LOWER BOUNDS;

APPROXIMATION THEORY; COMPUTATION THEORY; OPTIMIZATION;

COMMUNICATION;

EID: 84879812422     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488628     Document Type: Conference Paper

References (34)

1. F. Ablayev. Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 157(2):139-159, 1996.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences, 68(4):702-732, 2004.
3. B. Barak, M. Braverman, X. Chen, and A. Rao. How to compress interactive communication. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 67-76, New York, NY, USA, 2010. ACM.
4. R. Beigel and J. Tarui. On ACC [circuit complexity]. In Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on, pages 783-792. IEEE, 1991.
5. M. Braverman. Interactive information complexity. In Proceedings of the 44th symposium on Theory of Computing, STOC '12, pages 505-524, New York, NY, USA, 2012. ACM.
6. M. Braverman and A. Moitra. An information complexity approach to extended formulations. ECCC, 2012.
7. M. Braverman and A. Rao. Information equals amortized communication. In FOCS, pages 748-757, 2011.
8. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on, pages 107-117. IEEE, 2003.
9. A. Chakrabarti and O. Regev. An optimal lower bound on the communication complexity of gap-hamming-distance. In Proceedings of the 43rd annual ACM symposium on Theory of computing, pages 51-60. ACM, 2011.
10. A. Chakrabarti, Y. Shi, A. Wirth, and A. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In B. Werner, editor, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 270-278, Los Alamitos, CA, Oct. 14-17 2001. IEEE Computer Society.
11. A. Chattopadhyay and A. Ada. Multiparty communication complexity of disjointness. arXiv preprint arXiv:0801.3624, 2008.
12. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley series in telecommunications. J. Wiley and Sons, New York, 1991.
13. T. M. Cover and J. A. Thomas. Elements of information theory. Wiley-Interscience, New York, NY, USA, 1991.
14. J. Håstad and A. Wigderson. The randomized communication complexity of set disjointness. Theory Of Computing, 3:211-219, 2007.
15. D. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9):1098-1101, 1952.
16. P. Ishwar and N. Ma. Personal communication.
17. T. Jayram. Hellinger strikes back: A note on the multi-party information complexity of and. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 562-573, 2009.
18. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5(4):545-557, Nov. 1992.
19. M. Karchmer and A. Wigderson. Monotone circuits for connectivity require super-logarithmic depth. SIAM Journal on Discrete Mathematics, 3(2):255-265, 1990.
20. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997.
21. N. Ma and P. Ishwar. Two-terminal distributed source coding with alternating messages for function computation. In Information Theory, 2008. ISIT 2008. IEEE International Symposium on, pages 51-55. IEEE, 2008.
22. N. Ma and P. Ishwar. Infinite-message distributed source coding for two-terminal interactive computing. In Proc. of the 47th annual Allerton Conf. on Comm., Control, and Comp., Allerton'09, pages 1510-1517, Piscataway, NJ, USA, 2009. IEEE Press.
23. N. Ma and P. Ishwar. Some results on distributed source coding for interactive function computation. Information Theory, IEEE Transactions on, 57(9):6180-6195, 2011.
24. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal on Computing, 22(1):211-219, 1993.
25. A. Orlitsky. Worst-case interactive communication. i. two messages are almost optimal. Information Theory, IEEE Transactions on, 36(5):1111-1126, 1990.
26. A. Orlitsky. Worst-case interactive communication. ii. two messages are not optimal. Information Theory, IEEE Transactions on, 37(4):995-1005, 1991.
27. A. Razborov. On the distributed complexity of disjointness. TCS: Theoretical Computer Science, 106, 1992.
28. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67:145-159, 2003.
29. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27, 1948. Monograph B-1598.
30. A. Sherstov. The pattern matrix method (journal version). arXiv preprint arXiv:0906.4291, 2009.
31. A. Sherstov. The communication complexity of gap hamming distance. Theory of Computing, 8:197-208, 2012.
32. A. Sherstov. The multiparty communication complexity of set disjointness. In Proceedings of the 44th symposium on Theory of Computing, pages 525-548. ACM, 2012.
33. D. Slepian and J. K. Wolf. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory, 19(4):471-480, July 1973.
34. A. Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the eleventh annual ACM symposium on Theory of computing, pages 209-213. ACM, 1979.