{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:05Z","timestamp":1750220765930,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1816250"],"award-info":[{"award-number":["1816250"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,4]]},"DOI":"10.1145\/3369740.3369771","type":"proceedings-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:24:25Z","timestamp":1582140265000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Scalable Algorithm for Multiparty Interactive Communication with Private Channels"],"prefix":"10.1145","author":[{"given":"Abhinav","family":"Aggarwal","sequence":"first","affiliation":[{"name":"University of New Mexico, Albuquerque, NM"}]},{"given":"Varsha","family":"Dani","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM"}]},{"given":"Thomas P.","family":"Hayes","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM"}]}],"member":"320","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933085"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195136"},{"key":"e_1_3_2_1_3_1","volume-title":"Distributed asynchronous bellman-ford algorithm. Data networks","author":"Bertsekas D. P.","year":"1987","unstructured":"Bertsekas , D. P. , and Gallager , R. G . Distributed asynchronous bellman-ford algorithm. Data networks ( 1987 ), 4. Bertsekas, D. P., and Gallager, R. G. Distributed asynchronous bellman-ford algorithm. Data networks (1987), 4."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.02.007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.32"},{"key":"e_1_3_2_1_7_1","first-page":"1914","volume-title":"M. Coding for Interactive Computation: Progress and Challenges. In Allerton Conference on Communication, Control, and Computing (Allerton) (Oct","author":"Braverman","year":"2012","unstructured":"Braverman , M. Coding for Interactive Computation: Progress and Challenges. In Allerton Conference on Communication, Control, and Computing (Allerton) (Oct 2012 ), pp. 1914 -- 1921 . Braverman, M. Coding for Interactive Computation: Progress and Challenges. In Allerton Conference on Communication, Control, and Computing (Allerton) (Oct 2012), pp. 1914--1921."},{"key":"e_1_3_2_1_8_1","first-page":"161","volume-title":"M. Towards Deterministic Tree Code Constructions. In Proceedings of Innovations in Theoretical Computer Science Conference (ITCS)","author":"Braverman","year":"2012","unstructured":"Braverman , M. Towards Deterministic Tree Code Constructions. In Proceedings of Innovations in Theoretical Computer Science Conference (ITCS) ( 2012 ), pp. 161 -- 167 . Braverman, M. Towards Deterministic Tree Code Constructions. In Proceedings of Innovations in Theoretical Computer Science Conference (ITCS) (2012), pp. 161--167."},{"key":"e_1_3_2_1_9_1","first-page":"236","volume-title":"List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. In Proceedings of the Symposium on Foundations of Computer Science (FOCS)","author":"Braverman M.","year":"2014","unstructured":"Braverman , M. , and Efremenko , K . List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) ( 2014 ), pp. 236 -- 245 . Braverman, M., and Efremenko, K. List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2014), pp. 236--245."},{"key":"e_1_3_2_1_10_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), TR15-197","author":"Braverman M.","year":"2015","unstructured":"Braverman , M. , Efremenko , K. , Gelles , R. , and Haeupler , B . Constant-rate Coding for Multiparty Interactive Communication is Impossible . In Electronic Colloquium on Computational Complexity (ECCC), TR15-197 ( 2015 ). Braverman, M., Efremenko, K., Gelles, R., and Haeupler, B. Constant-rate Coding for Multiparty Interactive Communication is Impossible. In Electronic Colloquium on Computational Complexity (ECCC), TR15-197 (2015)."},{"key":"e_1_3_2_1_11_1","first-page":"159","volume-title":"Towards Coding for Maximum Errors in Interactive Communication. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC)","author":"Braverman M.","year":"2011","unstructured":"Braverman , M. , and Rao , A . Towards Coding for Maximum Errors in Interactive Communication. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC) ( 2011 ), pp. 159 -- 166 . Braverman, M., and Rao, A. Towards Coding for Maximum Errors in Interactive Communication. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC) (2011), pp. 159--166."},{"key":"e_1_3_2_1_12_1","first-page":"1","volume-title":"9th Innovations in Theoretical Computer Science Conference, ITCS 2018","author":"Censor-Hillel K.","year":"2018","unstructured":"Censor-Hillel , K. , Gelles , R. , and Haeupler , B . Making asynchronous distributed computations robust to channel noise . In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018 , January 11-14, 2018 , Cambridge, MA, USA (2018), pp. 50: 1 -- 50 :20. Censor-Hillel, K., Gelles, R., and Haeupler, B. Making asynchronous distributed computations robust to channel noise. In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA (2018), pp. 50:1--50:20."},{"key":"e_1_3_2_1_13_1","volume-title":"Elements of information theory","author":"Cover T. M.","year":"2012","unstructured":"Cover , T. M. , and Thomas , J. A . Elements of information theory . John Wiley & Sons , 2012 . Cover, T. M., and Thomas, J. A. Elements of information theory. John Wiley & Sons, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_46"},{"key":"e_1_3_2_1_16_1","volume-title":"Interactive communication with unknown noise rate. Information and Computation","author":"Dani V.","year":"2018","unstructured":"Dani , V. , Hayes , T. P. , Movahedi , M. , Saia , J. , and Young , M . Interactive communication with unknown noise rate. Information and Computation ( 2018 ). Dani, V., Hayes, T. P., Movahedi, M., Saia, J., and Young, M. Interactive communication with unknown noise rate. Information and Computation (2018)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0196-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2582176"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2367094"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"e_1_3_2_1_22_1","first-page":"768","volume-title":"Efficient and Explicit Coding for Interactive Communication. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) (Oct","author":"Gelles R.","year":"2011","unstructured":"Gelles , R. , Moitra , A. , and Sahai , A . Efficient and Explicit Coding for Interactive Communication. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) (Oct 2011 ), pp. 768 -- 777 . Gelles, R., Moitra, A., and Sahai, A. Efficient and Explicit Coding for Interactive Communication. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) (Oct 2011), pp. 768--777."},{"key":"e_1_3_2_1_23_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"67","author":"Gelles R.","year":"2017","unstructured":"Gelles , R. , and T Kalai , Y. Constant-rate interactive coding is impossible, even in constant-degree networks . In LIPIcs-Leibniz International Proceedings in Informatics ( 2017 ), vol. 67 , Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Gelles, R., and T Kalai, Y. Constant-rate interactive coding is impossible, even in constant-degree networks. In LIPIcs-Leibniz International Proceedings in Informatics (2017), vol. 67, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591872"},{"key":"e_1_3_2_1_26_1","first-page":"226","volume-title":"B. Interactive Channel Capacity Revisited. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Haeupler","year":"2014","unstructured":"Haeupler , B. Interactive Channel Capacity Revisited. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) ( 2014 ), IEEE, pp. 226 -- 235 . Haeupler, B. Interactive Channel Capacity Revisited. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (2014), IEEE, pp. 226--235."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884453"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688109"},{"key":"e_1_3_2_1_29_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"Lynch , N. A. Distributed Algorithms. Morgan Kaufmann , 1996 . Lynch, N. A. Distributed Algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554813"},{"key":"e_1_3_2_1_31_1","first-page":"7","volume":"55","author":"Ostrovsky R.","year":"2009","unstructured":"Ostrovsky , R. , Rabani , Y. , and Schulman , L.J . Error-Correcting Codes for Automatic Control. IEEE Transactions on Information Theory 55 , 7 ( 2009 ), 2931--2941. Ostrovsky, R., Rabani, Y., and Schulman, L.J. Error-Correcting Codes for Automatic Control. IEEE Transactions on Information Theory 55, 7 (2009), 2931--2941.","journal-title":"Error-Correcting Codes for Automatic Control. IEEE Transactions on Information Theory"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.03.007"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195462"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_35_1","first-page":"724","volume-title":"L. Communication on Noisy Channels: A Coding Theorem for Computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (Oct","author":"Schulman","year":"1992","unstructured":"Schulman , L. Communication on Noisy Channels: A Coding Theorem for Computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (Oct 1992 ), pp. 724 -- 733 . Schulman, L. Communication on Noisy Channels: A Coding Theorem for Computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (Oct 1992), pp. 724--733."},{"key":"e_1_3_2_1_36_1","first-page":"747","volume-title":"L. J. Deterministic Coding for Interactive Communication. In Proceedings of the ACM Symposium on Theory of Computing (STOC)","author":"Schulman","year":"1993","unstructured":"Schulman , L. J. Deterministic Coding for Interactive Communication. In Proceedings of the ACM Symposium on Theory of Computing (STOC) ( 1993 ), pp. 747 -- 756 . Schulman, L. J. Deterministic Coding for Interactive Communication. In Proceedings of the ACM Symposium on Theory of Computing (STOC) (1993), pp. 747--756."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/517021"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"e_1_3_2_1_40_1","first-page":"1597","volume-title":"INFOCOM 2002. Twenty-First annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE","volume":"3","author":"Wan P.-J.","year":"2002","unstructured":"Wan , P.-J. , Alzoubi , K. M. , and Frieder , O . Distributed construction of connected dominating set in wireless ad hoc networks . In INFOCOM 2002. Twenty-First annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE ( 2002 ), vol. 3 , IEEE, pp. 1597 -- 1604 . Wan, P.-J., Alzoubi, K. M., and Frieder, O. Distributed construction of connected dominating set in wireless ad hoc networks. In INFOCOM 2002. Twenty-First annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE (2002), vol. 3, IEEE, pp. 1597--1604."}],"event":{"name":"ICDCN 2020: 21st International Conference on Distributed Computing and Networking","sponsor":["ACM Association for Computing Machinery","Jadavpur University Jadavpur University"],"location":"Kolkata India","acronym":"ICDCN 2020"},"container-title":["Proceedings of the 21st International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369740.3369771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369740.3369771","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369740.3369771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:08Z","timestamp":1750200068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369740.3369771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,4]]},"references-count":40,"alternative-id":["10.1145\/3369740.3369771","10.1145\/3369740"],"URL":"https:\/\/doi.org\/10.1145\/3369740.3369771","relation":{},"subject":[],"published":{"date-parts":[[2020,1,4]]},"assertion":[{"value":"2020-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}