{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:59:53Z","timestamp":1770346793962,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"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":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451077","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1235-1247","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal error resilience of adaptive message exchange"],"prefix":"10.1145","author":[{"given":"Klim","family":"Efremenko","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gillat","family":"Kol","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghuvansh R.","family":"Saxena","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal Ran Gelles and Amit Sahai. 2016. Adaptive protocols for interactive communication. In Information Theory (ISIT). Pages 595\u2013599.","DOI":"10.1109\/ISIT.2016.7541368"},{"key":"e_1_3_2_1_2_1","unstructured":"Elwyn R. Berlekamp. 1964. Block Coding with Noiseless Feedback."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661628"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Mark Braverman. 2012. Towards deterministic tree code constructions. In Innovations in Theoretical Computer Science (ITCS). Pages 161\u2013167.","DOI":"10.1145\/2090236.2090250"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/141002001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734881"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993659"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096245"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2582176"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188884"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384320"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2367094"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1052202"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2829764"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Ran Gelles Ankur Moitra and Amit Sahai. 2011. Efficient and explicit coding for interactive communication. In Foundations of Computer Science (FOCS). Pages 768\u2013777.","DOI":"10.1109\/FOCS.2011.51"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294186"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Bernhard Haeupler. 2014. Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. In Foundations of Computer Science (FOCS). Pages 394\u2013403.","DOI":"10.1109\/FOCS.2014.49"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591872"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler. 2014. Interactive channel capacity revisited. In Foundations of Computer Science (FOCS). Pages 226\u2013235.","DOI":"10.1109\/FOCS.2014.32"},{"key":"e_1_3_2_1_21_1","unstructured":"Bernhard Haeupler Pritish Kamath and Ameya Velingker. 2015. Communication with partial noiseless feedback. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM)."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. In International Colloquium on Automata, Languages, and Programming (ICALP)","volume":"75","author":"Haeupler Bernhard","year":"2018","unstructured":"Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik. 2018. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. In International Colloquium on Automata, Languages, and Programming (ICALP). Pages 75:1\u201375:14.","journal-title":"Pages"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.138"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057118"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251412"},{"key":"e_1_3_2_1_27_1","unstructured":"Denis Pankratov. 2013. On the Power of Feedback in Interactive Channels. Manuscript."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Leonard J Schulman. 1992. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS). Pages 724\u2013733.","DOI":"10.1109\/SFCS.1992.267778"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167279"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"e_1_3_2_1_31_1","volume-title":"Sherstov and Pei Wu","author":"Alexander","year":"2017","unstructured":"Alexander A. Sherstov and Pei Wu. 2017. Optimal Interactive Coding for Insertions, Deletions, and Substitutions. In Foundations of Computer Science (FOCS). Pages 240\u2013251."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2017.8024594"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451077","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":32,"alternative-id":["10.1145\/3406325.3451077","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451077","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}