Information equals amortized communication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 748-757

  Braverman, Mark ^a   Rao, Anup ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Communication Complexity; Compression; Direct Sum

Indexed keywords

COMMUNICATION COMPLEXITY; DETERMINISTIC FUNCTIONS; DIRECT SUM; INFORMATION COSTS; INTERACTIVE PROTOCOLS; PARTIAL INFORMATION; SLEPIAN-WOLF THEOREM;

COMPACTION;

COMPUTER SCIENCE;

EID: 84863322607     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.86     Document Type: Conference Paper

References (15)

1. 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, vol. 68, no. 4, pp. 702-732, 2004. [Online]. Available: http://dx.doi.org/10.1016/j.jcss.2003.11.006
2. B. Barak, M. Braverman, X. Chen, and A. Rao, "How to compress interactive communication," in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, 2010.
3. A. Chakrabarti, Y. Shi, A. Wirth, and A. Yao, "Informational complexity and the direct sum problem for simultaneous message complexity," in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, B.Werner, Ed. Los Alamitos, CA: IEEE Computer Society, Oct. 14-17 2001, pp. 270-278.
4. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley series in telecommunications. J. Wiley and Sons, New York, 1991.
5. P. Cuff, "Communication requirements for generating correlated random variables," CoRR, vol. abs/0805.0065, 2008, informal publication. [Online]. Available: http://arxiv.org/abs/0805.0065
6. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan, "Amortized communication complexity," SIAM Journal on Computing, vol. 24, no. 4, pp. 736-750, 1995, prelim version by Feder, Kushilevitz, Naor FOCS 1991.
7. P. Harsha, R. Jain, D. A. McAllester, and J. Radhakrishnan, "The communication complexity of correlation," in IEEE Conference on Computational Complexity. IEEE Computer Society, 2007, pp. 10-23. [Online]. Available: http://doi. ieeecomputersociety.org/10.1109/CCC.2007.32
8. T. Holenstein, "Parallel repetition: Simplifications and the no-signaling case," in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007.
9. R. Jain, J. Radhakrishnan, and P. Sen, "A direct sum theorem in communication complexity via message compression,"in ICALP, ser. Lecture Notes in Computer Science, J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, Eds., vol. 2719. Springer, 2003, pp. 300-315. [Online]. Available: http://link.springer.de/link/service/series/ 0558/bibs/2719/27190300.htm
10. H. Klauck, "A strong direct product theorem for disjointness, "in STOC, L. J. Schulman, Ed. ACM, 2010, pp. 77-86. [Online]. Available: http://doi.acm.org/10.1145/1806689.1806702
11. A. Rao, "Parallel repetition in projection games and a concentration bound," in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008.
12. R. Shaltiel, "Towards proving strong direct product theorems,"Computational Complexity, vol. 12, no. 1-2, pp. 1-22, 2003. (Pubitemid 38670746)
13. C. E. Shannon, "A mathematical theory of communication,"Bell System Technical Journal, vol. 27, 1948, monograph B-1598.
14. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471-480, Jul. 1973.
15. A. D. Wyner, "The common information of two dependent random variables," IEEE Transactions on Information Theory, vol. 21, no. 2, March 1975.