{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:54Z","timestamp":1750220334996,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"United States-Israel Binational Science Foundation (BSF)","award":["2020277"],"award-info":[{"award-number":["2020277"]}]},{"name":"Israel Science Foundation (ISF)","award":["1078\/17, 1102\/21"],"award-info":[{"award-number":["1078\/17, 1102\/21"]}]},{"name":"European Union?s Horizon 2020","award":["755839"],"award-info":[{"award-number":["755839"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538432","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"141-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Computations in Fully-Defective Networks"],"prefix":"10.1145","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shir","family":"Cohen","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Gelles","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gal","family":"Sela","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Abhinav Aggarwal Varsha Dani Thomas P. Hayes and Jared Saia. 2018. Sending a Message with Unknown Noise. In ICDCN. Article 8 10 pages.  Abhinav Aggarwal Varsha Dani Thomas P. Hayes and Jared Saia. 2018. Sending a Message with Unknown Noise. In ICDCN. Article 8 10 pages.","DOI":"10.1145\/3154273.3154318"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Abhinav Aggarwal Varsha Dani Thomas P. Hayes and Jared Saia. 2020. A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. In ICDCN. Article 8 15 pages.  Abhinav Aggarwal Varsha Dani Thomas P. Hayes and Jared Saia. 2020. A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. In ICDCN. Article 8 15 pages.","DOI":"10.1145\/3369740.3369771"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0303-5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152612"},{"key":"e_1_3_2_2_5_1","volume-title":"Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems","volume":"1","author":"Biely Martin","year":"2003","unstructured":"Martin Biely . 2003 . An optimal Byzantine agreement algorithm with arbitrary node and link failures . In Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems , Vol. 1 . 146--151. Martin Biely. 2003. An optimal Byzantine agreement algorithm with arbitrary node and link failures. In Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Vol. 1. 146--151."},{"key":"e_1_3_2_2_6_1","article-title":"Constant-Rate Coding for Multiparty Interactive Communication Is Impossible","volume":"65","author":"Braverman Mark","year":"2017","unstructured":"Mark Braverman , Klim Efremenko , Ran Gelles , and Bernhard Haeupler . 2017 . Constant-Rate Coding for Multiparty Interactive Communication Is Impossible . J. ACM , Vol. 65 , 1, Article 4 (2017), 41 pages. Mark Braverman, Klim Efremenko, Ran Gelles, and Bernhard Haeupler. 2017. Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. J. ACM, Vol. 65, 1, Article 4 (2017), 41 pages.","journal-title":"J. ACM"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Shir Cohen Ran Gelles and Gal Sela. 2022. Distributed Computations in Fully-Defective Networks. arxiv: 2205.11148  Keren Censor-Hillel Shir Cohen Ran Gelles and Gal Sela. 2022. Distributed Computations in Fully-Defective Networks. arxiv: 2205.11148","DOI":"10.1145\/3519270.3538432"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0343-5"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Varsha Dani Mahnush Movahedi Jared Saia and Maxwell Young. 2015. Interactive Communication with Unknown Noise Rate. In ICALP. 575--587.  Varsha Dani Mahnush Movahedi Jared Saia and Maxwell Young. 2015. Interactive Communication with Unknown Noise Rate. In ICALP. 575--587.","DOI":"10.1007\/978-3-662-47666-6_46"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00202-0"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"volume-title":"Fault-Tolerant Design","author":"Dubrova Elena","key":"e_1_3_2_2_12_1","unstructured":"Elena Dubrova . 2013. Fault-Tolerant Design . Springer . Elena Dubrova. 2013. Fault-Tolerant Design. Springer."},{"key":"e_1_3_2_2_13_1","first-page":"1","article-title":"Interactive Coding with Constant Round and Communication Blowup","volume":"7","author":"Efremenko Klim","year":"2020","unstructured":"Klim Efremenko , Elad Haramaty , and Yael Tauman Kalai . 2020 . Interactive Coding with Constant Round and Communication Blowup . In ITCS. 7 : 1 -- 7 :34. Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai. 2020. Interactive Coding with Constant Round and Communication Blowup. In ITCS. 7:1--7:34.","journal-title":"ITCS."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680833478"},{"key":"e_1_3_2_2_16_1","first-page":"1","article-title":"Interactive Coding Resilient to an Unknown Number of Erasures","volume":"13","author":"Gelles Ran","year":"2020","unstructured":"Ran Gelles and Siddharth Iyer . 2020 . Interactive Coding Resilient to an Unknown Number of Erasures . In OPODIS. 13 : 1 -- 13 :16. Ran Gelles and Siddharth Iyer. 2020. Interactive Coding Resilient to an Unknown Number of Erasures. In OPODIS. 13:1--13:16.","journal-title":"OPODIS."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904576"},{"key":"e_1_3_2_2_18_1","volume-title":"Yael Tauman Kalai, and Govind Ramnarayan","author":"Gelles Ran","year":"2019","unstructured":"Ran Gelles , Yael Tauman Kalai, and Govind Ramnarayan . 2019 . Efficient Multiparty Interactive Coding for Insertions, Deletions , and Substitutions. In PODC. 137--146. Ran Gelles, Yael Tauman Kalai, and Govind Ramnarayan. 2019. Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. In PODC. 137--146."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294186"},{"key":"e_1_3_2_2_20_1","volume-title":"Dependable Computing and Fault Tolerant Systems","volume":"10","author":"Gong Li","year":"1995","unstructured":"Li Gong , Patrick Lincoln , and John Rushby . 1995 . Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults . In Dependable Computing and Fault Tolerant Systems , Vol. 10 . IEEE Computer Society, 139--158. Li Gong, Patrick Lincoln, and John Rushby. 1995. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults. In Dependable Computing and Fault Tolerant Systems, Vol. 10. IEEE Computer Society, 139--158."},{"key":"e_1_3_2_2_21_1","series-title":"Lecture Notes in Computer Science","volume-title":"Operating Systems","author":"Gray J.N.","unstructured":"J.N. Gray . 1978. Notes on data base operating systems . In Operating Systems . Lecture Notes in Computer Science , Vol. 60 . Springer , Berlin, Heidelberg . J.N. Gray. 1978. Notes on data base operating systems. In Operating Systems. Lecture Notes in Computer Science, Vol. 60. Springer, Berlin, Heidelberg."},{"key":"e_1_3_2_2_22_1","first-page":"1","article-title":"a. Broadcast CONGEST Algorithms against Adversarial Edges","volume":"23","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter . 2021 a. Broadcast CONGEST Algorithms against Adversarial Edges . In DISC. 23 : 1 -- 23 :19. Yael Hitron and Merav Parter. 2021 a. Broadcast CONGEST Algorithms against Adversarial Edges. In DISC. 23:1--23:19.","journal-title":"DISC."},{"key":"e_1_3_2_2_23_1","first-page":"1","article-title":"b. General CONGEST Compilers against Adversarial Edges","volume":"24","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter . 2021 b. General CONGEST Compilers against Adversarial Edges . In DISC. 24 : 1 -- 24 :18. Yael Hitron and Merav Parter. 2021 b. General CONGEST Compilers against Adversarial Edges. In DISC. 24:1--24:18.","journal-title":"DISC."},{"key":"e_1_3_2_2_24_1","volume-title":"Schulman","author":"Hoza William M.","year":"2016","unstructured":"William M. Hoza and Leonard J . Schulman . 2016 . The Adversarial Noise Threshold for Distributed Protocols. In SODA. 240--258. William M. Hoza and Leonard J. Schulman. 2016. The Adversarial Noise Threshold for Distributed Protocols. In SODA. 240--258."},{"key":"e_1_3_2_2_25_1","volume-title":"Yael Tauman Kalai, and Allison Lewko","author":"Jain Abhishek","year":"2015","unstructured":"Abhishek Jain , Yael Tauman Kalai, and Allison Lewko . 2015 . Interactive Coding for Multiparty Protocols. In ITCS. 1--10. Abhishek Jain, Yael Tauman Kalai, and Allison Lewko. 2015. Interactive Coding for Multiparty Protocols. In ITCS. 1--10."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Israel Koren and C. Mani Krishna (Eds.). 2020. Fault-Tolerant Systems second edition ed.). Morgan Kaufmann San Francisco (CA).  Israel Koren and C. Mani Krishna (Eds.). 2020. Fault-Tolerant Systems second edition ed.). Morgan Kaufmann San Francisco (CA).","DOI":"10.1016\/B978-0-12-818105-8.00014-0"},{"key":"e_1_3_2_2_27_1","unstructured":"Allison Lewko and Ellen Vitercik. 2015. Balancing Communication for Multi-party Interactive Coding. arxiv: 1503.06381  Allison Lewko and Ellen Vitercik. 2015. Balancing Communication for Multi-party Interactive Coding. arxiv: 1503.06381"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Merav Parter and Eylon Yogev. 2019 a. Low Congestion Cycle Covers and Their Applications. In SODA. 1673--1692.  Merav Parter and Eylon Yogev. 2019 a. Low Congestion Cycle Covers and Their Applications. In SODA. 1673--1692.","DOI":"10.1137\/1.9781611975482.101"},{"key":"e_1_3_2_2_29_1","first-page":"1","article-title":"b. Optimal Short Cycle Decomposition in Almost Linear Time","volume":"89","author":"Parter Merav","year":"2019","unstructured":"Merav Parter and Eylon Yogev . 2019 b. Optimal Short Cycle Decomposition in Almost Linear Time . In ICALP. 89 : 1 -- 89 :14. Merav Parter and Eylon Yogev. 2019 b. Optimal Short Cycle Decomposition in Almost Linear Time. In ICALP. 89:1--89:14.","journal-title":"ICALP."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220503"},{"key":"e_1_3_2_2_31_1","volume-title":"Perry and Sam Toueg","author":"Kenneth","year":"1986","unstructured":"Kenneth J. Perry and Sam Toueg . 1986 . Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering , Vol. SE-12 , 3 (1986), 477--482. Kenneth J. Perry and Sam Toueg. 1986. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, Vol. SE-12, 3 (1986), 477--482."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Sridhar Rajagopalan and Leonard Schulman. 1994. A coding theorem for distributed computation. In STOC. 790--799.  Sridhar Rajagopalan and Leonard Schulman. 1994. A coding theorem for distributed computation. In STOC. 790--799.","DOI":"10.1145\/195058.195462"},{"volume-title":"Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach","author":"Raynal Michel","key":"e_1_3_2_2_33_1","unstructured":"Michel Raynal . 2018. Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach . Springer , Cham . 459 pages. Michel Raynal. 2018. Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach. Springer, Cham. 459 pages."},{"key":"e_1_3_2_2_34_1","volume-title":"A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly","author":"Robbins Herbert Ellis","year":"1939","unstructured":"Herbert Ellis Robbins . 1939. A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly ( 1939 ). Herbert Ellis Robbins. 1939. A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly (1939)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52921-7_85"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050016"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970443999X"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Leonard J. Schulman. 1992. Communication on noisy channels: a coding theorem for computation. In FOCS. 724--733.  Leonard J. Schulman. 1992. Communication on noisy channels: a coding theorem for computation. In FOCS. 724--733.","DOI":"10.1109\/SFCS.1992.267778"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Leonard J. Schulman. 1993. Deterministic coding for interactive communication. In STOC (San Diego California United States). 747--756.  Leonard J. Schulman. 1993. Deterministic coding for interactive communication. In STOC (San Diego California United States). 747--756.","DOI":"10.1145\/167088.167279"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.667895"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1932-1501641-2"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538432","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":41,"alternative-id":["10.1145\/3519270.3538432","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538432","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}