{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T08:51:12Z","timestamp":1781686272359,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806701","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"67-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["How to compress interactive communication"],"prefix":"10.1145","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Braverman","sequence":"additional","affiliation":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875561"},{"key":"e_1_3_2_1_3_1","series-title":"Wiley series in telecommunications","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"Cover T. M.","year":"1991","unstructured":"T. M. Cover and J. A. Thomas . Elements of Information Theory . Wiley series in telecommunications . J. Wiley and Sons , New York , 1991 . T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley series in telecommunications. J. Wiley and Sons, New York, 1991."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235864"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90074-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.32"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"R.\n      Jain J.\n      Radhakrishnan and \n      P.\n      Sen\n  . \n  A direct sum theorem in communication complexity via message compression\n  . In J. C. M. Baeten J. K. Lenstra J. Parrow and G. 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  .   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.","DOI":"10.1007\/3-540-45061-0_26"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806702"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206317"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90089-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_16_1","first-page":"27","article-title":"A mathematical theory of communication","author":"Shannon C. E.","year":"1948","unstructured":"C. E. Shannon . A mathematical theory of communication . Bell System Technical Journal , 27 , 1948 . Monograph B-1598. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27, 1948. Monograph B-1598.","journal-title":"Bell System Technical Journal"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0175-x"},{"issue":"6","key":"e_1_3_2_1_18_1","first-page":"937","article-title":"On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements","volume":"15","author":"Uhlig D.","year":"1974","unstructured":"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 . 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.","journal-title":"Matematicheskie Zametki"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":19,"alternative-id":["10.1145\/1806689.1806701","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806701","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}