{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:53:03Z","timestamp":1770753183842,"version":"3.50.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214025","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"505-524","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Interactive information complexity"],"prefix":"10.1145","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.33"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.03.015"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.86"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.11"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185449"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_2_8_1","unstructured":"Arkadev Chattopadhyay and Anil Ada. Multiparty communication complexity of disjointness. Electronic Colloquium on Computational Complexity (ECCC) 15(002) 2008.  Arkadev Chattopadhyay and Anil Ada. Multiparty communication complexity of disjointness. Electronic Colloquium on Computational Complexity (ECCC) 15(002) 2008."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993644"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875561"},{"key":"e_1_3_2_2_11_1","unstructured":"Thomas M.\n       \n      Cover\n     and \n      \n      \n      Joy A.\n       \n      Thomas\n      \n  \n  . \n  Elements of Information Theory\n  . \n  Wiley series in telecommunications\n  . \n  J. Wiley and Sons New York 1991\n  .   Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley series in telecommunications. J. Wiley and Sons New York 1991."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.006"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235864"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89582"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.32"},{"key":"e_1_3_2_2_16_1","unstructured":"Rahul Jain. New strong direct product results in communication complexity. Electronic Colloquium on Computational Complexity (ECCC) 18:24 2011.  Rahul Jain. New strong direct product results in communication complexity. Electronic Colloquium on Computational Complexity (ECCC) 18:24 2011."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.39"},{"key":"e_1_3_2_2_18_1","first-page":"54","volume-title":"COCOON","author":"Jain Rahul","year":"2010"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Rahul\n       \n      Jain Jaikumar\n       \n      Radhakrishnan and \n      \n      \n      Pranab\n       \n      Sen\n    .\n      \n  \n   \n  A direct sum theorem in communication complexity via message compression. In Jos C. M. Baeten Jan Karel Lenstra Joachim Parrow and Gerhard J. Woeginger editors ICALP volume \n  2719\n   of \n  Lecture Notes in Computer Science pages \n  300\n  --\n  315\n  . \n  Springer 2003\n  .   Rahul Jain Jaikumar Radhakrishnan and Pranab Sen. A direct sum theorem in communication complexity via message compression. In Jos C. M. Baeten Jan Karel Lenstra Joachim Parrow and Gerhard J. Woeginger editors ICALP volume 2719 of Lecture Notes in Computer Science pages 300--315. Springer 2003.","DOI":"10.1007\/3-540-45061-0_26"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1113-7"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806702"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993642"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0276-2"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0292-2"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.14"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301343"},{"key":"e_1_3_2_2_31_1","first-page":"27","article-title":"A mathematical theory of communication","author":"Shannon Claude E.","year":"1948","journal-title":"Bell System Technical Journal"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0175-x"},{"key":"e_1_3_2_2_33_1","unstructured":"Alexander A. Sherstov. The communication complexity of gap hamming distance. Electronic Colloquium on Computational Complexity (ECCC) 18:63 2011.  Alexander A. Sherstov. The communication complexity of gap hamming distance. Electronic Colloquium on Computational Complexity (ECCC) 18:63 2011."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"e_1_3_2_2_35_1","unstructured":"Thomas Vidick. A concentration inequality for the overlap of a vector on a large set with application to the communication complexity of the gap-hamming-distance problem. Electronic Colloquium on Computational Complexity (ECCC) 18:51 2011.  Thomas Vidick. A concentration inequality for the overlap of a vector on a large set with application to the communication complexity of the gap-hamming-distance problem. Electronic Colloquium on Computational Complexity (ECCC) 18:51 2011."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89583"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":36,"alternative-id":["10.1145\/2213977.2214025","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214025","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}