Coding for interactive computation: Progress and challenges

2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Volumn , Issue , 2012, Pages 1914-1921

  Braverman, Mark ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION COMPLEXITY; INTERACTIVE COMPUTATION; RECENT PROGRESS;

COMMUNICATION;

EID: 84875727396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2012.6483456     Document Type: Conference Paper

References (28)

1. R. Ahlswede and N. Cai. On communication complexity of vector-valued functions. Information Theory, IEEE Transactions on, 40(6):2062-2067, 1994.
2. Boaz Barak, Mark Braverman, Xi Chen, and Anup 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.
3. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
4. Mark Braverman, Ankit Garg, Denis Pankratov, and OmriWeinstein. Information and exact communication complexity. forthcoming, 2012.
5. Mark Braverman, Ankit Garg, Denis Pankratov, and Omri Weinstein. On the external information complexity. in progress, 2012.
6. Z. Brakerski and Y.T. Kalai. Efficient interactive coding against adversarial noise. In Electronic Colloquium on Computational Complexity (ECCC), 2012.
7. M. Braverman and A. Rao. Towards coding for maximum errors in interactive communication. In Proceedings of the 43rd annual ACM symposium on Theory of computing, pages 159-166. ACM, 2011.
8. Mark Braverman and Anup Rao. Information equals amortized communication. In FOCS, pages 748-757, 2011.
9. M. Braverman. Towards deterministic tree code constructions. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 161-167. ACM, 2012.
10. Mark 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.
11. 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.
12. Ziv Bar-Yossef, T. S. Jayram, Ravi 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.
13. A. Chattopadhyay and T. Pitassi. The story of set disjointness. ACM SIGACT News, 41(3):59-85, 2010.
14. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Bob Werner, editor, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 270-278, Los Alamitos, CA, October 14-17 2001. IEEE Computer Society. (Pubitemid 33068387)
15. R. Gelles, A. Moitra, and A. Sahai. Efficient and explicit coding for interactive communication. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 768-777. IEEE, 2011.
16. Prahladh Harsha, Rahul Jain, David A. McAllester, and Jaikumar Radhakrishnan. The communication complexity of correlation. In IEEE Conference on Computational Complexity, pages 10-23. IEEE Computer Society, 2007. (Pubitemid 47485120)
17. Hartmut Klauck. Quantum and approximate privacy. Theory Comput. Syst., 37(1):221-246, 2004. (Pubitemid 38259813)
18. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997.
19. 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.
20. N. Ma, P. Ishwar, and P. Gupta. Interactive source coding for function computation in collocated networks. Information Theory, IEEE Transactions on, 58(7):4289-4305, 2012.
21. F. J. MacWilliams and N. J. A. Sloane. The theory of error correcting codes. North-Holland, New York, 1977.
22. Ilan Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, 31 July 1991. (Pubitemid 21730230)
23. A. Orlitsky. Worst-case interactive communication. i. two messages are almost optimal. Information Theory, IEEE Transactions on, 36(5):1111-1126, 1990. (Pubitemid 20738370)
24. A. Orlitsky. Worst-case interactive communication. ii. two messages are not optimal. Information Theory, IEEE Transactions on, 37(4):995-1005, 1991. (Pubitemid 21674995)
25. Leonard J. Schulman. Coding for interactive communication. IEEE Transactions on Information Theory, 42(6):1745-1756, 1996. (Pubitemid 126769174)
26. M. Sudan. List decoding: Algorithms and applications. Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, pages 25-41, 2000.
27. M. Sudan. Algorithmic introduction to coding theory - course notes, 2001. http://people.csail.mit.edu/madhu/FT01/course.html.
28. David Slepian and Jack K. Wolf. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory, 19(4):471-480, July 1973.