{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985366,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733529","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"444-454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds on Channel Reliability via Generalized Quorum Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9444-3221","authenticated-orcid":false,"given":"Alejandro","family":"Naser-Pastoriza","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"},{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6700-9235","authenticated-orcid":false,"given":"Gregory","family":"Chockler","sequence":"additional","affiliation":[{"name":"University of Surrey, UK, Guildford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2454-4171","authenticated-orcid":false,"given":"Alexey","family":"Gotsman","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4175-0361","authenticated-orcid":false,"given":"Fedor","family":"Ryabinin","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"},{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Symposium on Foundations and Applications of Blockchain (FAB).","author":"A\u015ftef\u0103noaei L\u0103cr\u0103mioara","year":"2021","unstructured":"L\u0103cr\u0103mioara A\u015ftef\u0103noaei, Pierre Chambart, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci-Piergiovanni, and Eugen Z\u0103linescu. 2021. Tenderbake - A Solution to Dynamic Repeated Consensus for Blockchains. In Symposium on Foundations and Applications of Blockchain (FAB)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35668-1_16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00235-7"},{"key":"e_1_3_2_1_5_1","volume-title":"Communication-Efficient Leader Election and Consensus with Limited Link Synchrony. In Symposium on Principles of Distributed Computing (PODC).","author":"Aguilera Marcos K.","year":"2004","unstructured":"Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, and Sam Toueg. 2004. Communication-Efficient Leader Election and Consensus with Limited Link Synchrony. In Symposium on Principles of Distributed Computing (PODC)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0068-y"},{"key":"e_1_3_2_1_7_1","volume-title":"Symposium on Operating Systems Design and Implementation (OSDI).","author":"Alfatafta Mohammed","year":"2020","unstructured":"Mohammed Alfatafta, Basil Alkhatib, Ahmed Alquraan, and Samer Al-Kiswany. 2020. Toward a Generic Fault Tolerance Technique for Partial Network Partitioning. In Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_3_2_1_8_1","volume-title":"An Analysis of Network-Partitioning Failures in Cloud Systems. In Symposium on Operating Systems Design and Implementation (OSDI).","author":"Alquraan Ahmed","year":"2018","unstructured":"Ahmed Alquraan, Hatem Takruri, Mohammed Alfatafta, and Samer Al-Kiswany. 2018. An Analysis of Network-Partitioning Failures in Cloud Systems. In Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_3_2_1_10_1","volume-title":"Lower Bound on the Step Complexity of Anonymous Binary Consensus. In Symposium on Distributed Computing (DISC).","author":"Attiya Hagit","year":"2016","unstructured":"Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. 2016. Lower Bound on the Step Complexity of Anonymous Binary Consensus. In Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242714"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.9732"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"\u00c9tienne Coulouma and Emmanuel Godard. 2013. A Characterization of Dynamic Networks Where Consensus Is Solvable. In Structural Information and Communication Complexity (SIROCCO).","DOI":"10.1007\/978-3-319-03578-9_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.024"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_18_1","volume-title":"Symposium on Principles of Distributed Computing (PODC).","author":"Dolev Danny","year":"1997","unstructured":"Danny Dolev, Roy Friedman, Idit Keidar, and Dahlia Malkhi. 1997. Failure detectors in omission failure environments (Brief Announcement). In Symposium on Principles of Distributed Computing (PODC)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77096-1_14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290183"},{"key":"e_1_3_2_1_22_1","volume-title":"Australian Computer Science Conference (ASCS).","author":"Fidge Colin","year":"1988","unstructured":"Colin Fidge. 1988. Timestamps in message-passing systems that preserve the partial ordering. In Australian Computer Science Conference (ASCS)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_27_1","volume-title":"Conference on Principles of Distributed Systems (OPODIS).","author":"Howard Heidi","year":"2016","unstructured":"Heidi Howard, Dahlia Malkhi, and Alexander Spiegelman. 2016. Flexible Paxos: Quorum intersection revisited. In Conference on Principles of Distributed Systems (OPODIS)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2008.24"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_31_1","volume-title":"RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In Symposium on Distributed Computing (DISC).","author":"Nancy","unstructured":"Nancy A. Lynch and Alexander A. Shvartsman. 2002. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_16"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365692"},{"key":"e_1_3_2_1_35_1","volume-title":"Cogsworth: Byzantine View Synchronization. In Cryptoeconomics Systems Conference (CES).","author":"Naor Oded","year":"2020","unstructured":"Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2020. Cogsworth: Byzantine View Synchronization. In Cryptoeconomics Systems Conference (CES)."},{"key":"e_1_3_2_1_36_1","volume-title":"Conference on Principles of Distributed Systems (OPODIS).","author":"Naser-Pastoriza Alejandro","year":"2023","unstructured":"Alejandro Naser-Pastoriza, Gregory Chockler, and Alexey Gotsman. 2023. Fault-tolerant computing with unreliable channels. In Conference on Principles of Distributed Systems (OPODIS)."},{"key":"e_1_3_2_1_37_1","unstructured":"Alejandro Naser-Pastoriza Gregory Chockler Alexey Gotsman and Fedor Ryabinin. 2025. Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version). arXiv:2505.02646 [cs.DC] https:\/\/arxiv.org\/abs\/2505.02646"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90019-B"},{"key":"e_1_3_2_1_39_1","volume-title":"Omni-Paxos: Breaking the Barriers of Partial Connectivity. In European Conference on Computer Systems (EuroSys).","author":"Ng Harald","year":"2023","unstructured":"Harald Ng, Seif Haridi, and Paris Carbone. 2023. Omni-Paxos: Breaking the Barriers of Partial Connectivity. In European Conference on Computer Systems (EuroSys)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331624"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/9782.9791"},{"key":"e_1_3_2_1_42_1","volume-title":"Network Topology and Fault-Tolerant Consensus","author":"Sakavalas Dimitris","unstructured":"Dimitris Sakavalas and Lewis Tseng. 2019. Network Topology and Fault-Tolerant Consensus. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_43_1","volume-title":"Symposium on Theoretical Aspects of Computer Science (STACS).","author":"Santoro Nicola","year":"1989","unstructured":"Nicola Santoro and Peter Widmayer. 1989. Time is not a healer. In Symposium on Theoretical Aspects of Computer Science (STACS)."},{"key":"e_1_3_2_1_44_1","volume-title":"Symposium on Algorithms (SIGAL).","author":"Santoro Nicola","year":"1990","unstructured":"Nicola Santoro and Peter Widmayer. 1990. Distributed function evaluation in the presence of transmission faults. In Symposium on Algorithms (SIGAL)."},{"key":"e_1_3_2_1_45_1","article-title":"Impossibility Results and Lower Bounds for Consensus under Link Failures","volume":"38","author":"Schmid Ulrich","year":"2009","unstructured":"Ulrich Schmid, Bettina Weiss, and Idit Keidar. 2009. Impossibility Results and Lower Bounds for Consensus under Link Failures. SIAM J. Comput. 38, 5 (2009).","journal-title":"SIAM J. Comput."}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:40Z","timestamp":1749824620000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":42,"alternative-id":["10.1145\/3732772.3733529","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733529","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}