How to compress interactive communication

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 67-76

  Barak, Boaz ^a   Braverman, Mark ^b   Chen, Xi ^c   Rao, Anup ^d  

^a PRINCETON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d UNIVERSITY OF WASHINGTON   (United States)

Author keywords

communication complexity; compression; direct sum; information theory

Indexed keywords

AVERAGE-CASE COMPLEXITY; COMMUNICATION COMPLEXITY; COMMUNICATION PROTOCOLS; COMPRESSION; DIRECT SUM; INTERACTIVE COMMUNICATIONS; NEW PROTOCOL; POLY-LOGARITHMIC FACTORS; PRODUCT DISTRIBUTIONS; WORST CASE;

COMMUNICATION; INFORMATION THEORY;

COMPUTATION THEORY;

EID: 77954724787     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806701     Document Type: Conference Paper

References (20)

1. M. Braverman and A. Rao. Work in progress.
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. 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.
4. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley series in telecommunications. J. Wiley and Sons, New York, 1991.
5. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan. Amortized communication complexity. SIAM Journal on Computing, 24(4):736-750, 1995. Prelim version by Feder, Kushilevitz, Naor FOCS 1991.
6. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Computing with noisy information. SIAM Journal on Computing, 23(5):1001-1018, 1994.
7. G. Galbiati and M. Fischer. On the complexity of 2-output boolean networks. Theor. Comput. Sci., 16:177-185, 1981.
8. P. Harsha, R. Jain, D. A. McAllester, and J. Radhakrishnan. The communication complexity of correlation. In IEEE Conference on Computational Complexity, pages 10-23. IEEE Computer Society, 2007.
9. R. Jain, J. Radhakrishnan, and P. Sen. A direct sum theorem in communication complexity via message compression. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, ICALP, volume 2719 of Lecture Notes in Computer Science, pages 300-315. Springer, 2003.
10. H. Klauck. A strong direct product theorem for disjointness. In STOC, 2010.
11. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997.
12. 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. Prelim version CCC 1991.
13. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, 31 July 1991.
14. W. Paul. Realizing boolean functions on disjoint sets of variables. Theor. Comput. Sci., 2:383-396, 1976.
15. Razborov. On the distributed complexity of disjointness. TCS: Theoretical Computer Science, 106, 1992.
16. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998. Prelim version in STOC '95.
17. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27, 1948. Monograph B-1598.
18. R. Shaltiel. Towards proving strong direct product theorems. Computational Complexity, 12(1-2):1-22, 2003.
19. D. Uhlig. On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements. Matematicheskie Zametki, 15(6):937-944, 1974.
20. A. C.-C. Yao. Theory and applications of trapdoor functions (extended abstract). In FOCS, pages 80-91. IEEE, 1982.