{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T04:30:25Z","timestamp":1775190625744,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594594","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"300-309","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Message-Passing with Noisy Beeps"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5646-9524","authenticated-orcid":false,"given":"Peter","family":"Davies","sequence":"first","affiliation":[{"name":"Computer Science, Durham University, Durham, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Beeping a maximal independent set. Distributed computing 26, 4","author":"Afek Yehuda","year":"2013","unstructured":"Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, and Fabian Kuhn. 2013. Beeping a maximal independent set. Distributed computing 26, 4 (2013), 195--208."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1193210"},{"key":"e_1_3_2_1_3_1","volume-title":"Distributed Approximate Maximum Matching in the CONGEST Model. In 32nd International Symposium on Distributed Computing (DISC","author":"Ahmadi Mohamad","year":"2018","unstructured":"Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed Approximate Maximum Matching in the CONGEST Model. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104925"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_6_1","volume-title":"Optimal Multi-cast with Beeps Using Group Testing","author":"Beauquier Joffroy","unstructured":"Joffroy Beauquier, Janna Burman, Peter Davies, and Fabien Dufoulon. 2019. Optimal Multi-cast with Beeps Using Group Testing. In Structural Information and Communication Complexity, Keren Censor-Hillel and Michele Flammini (Eds.). Springer International Publishing, Cham, 66--80."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.03.020"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.027"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Peter Davies. 2023. Optimal Message-Passing with Noisy Beeps. arXiv:2303.15346","DOI":"10.1145\/3583668.3594594"},{"key":"e_1_3_2_1_12_1","volume-title":"32nd International Symposium on Distributed Computing (DISC","author":"Dufoulon Fabien","year":"2018","unstructured":"Fabien Dufoulon, Janna Burman, and Joffroy Beauquier. 2018. Beeping a deterministic time-optimal leader election. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405699"},{"key":"e_1_3_2_1_14_1","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"D'yachkov Arkadii Georgievich","year":"1982","unstructured":"Arkadii Georgievich D'yachkov and Vladimir Vasil'evich Rykov. 1982. Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18, 3 (1982), 7--13.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0279-3"},{"key":"e_1_3_2_1_16_1","volume-title":"Deterministic Leader Election in Multi-hop Beeping Networks","author":"F\u00f6rster Klaus-Tycho","unstructured":"Klaus-Tycho F\u00f6rster, Jochen Seidel, and Roger Wattenhofer. 2014. Deterministic Leader Election in Multi-hop Beeping Networks. In Distributed Computing, Fabian Kuhn (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 212--226."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884455"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627871"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451089"},{"key":"e_1_3_2_1_21_1","volume-title":"35th International Symposium on Distributed Computing (DISC","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter. 2021. Broadcast CONGEST Algorithms against Adversarial Edges. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_22_1","volume-title":"Fundamentals of error-correcting codes","author":"Cary Huffman W","unstructured":"W Cary Huffman and Vera Pless. 2010. Fundamentals of error-correcting codes. Cambridge university press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767405"},{"key":"e_1_3_2_1_25_1","series-title":"SIAM journal on computing 15, 4","volume-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby Michael","year":"1986","unstructured":"Michael Luby. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM journal on computing 15, 4 (1986), 1036--1053."},{"key":"e_1_3_2_1_26_1","volume-title":"Some simple distributed algorithms for sparse networks. Distributed computing 14, 2","author":"Panconesi Alessandro","year":"2001","unstructured":"Alessandro Panconesi and Romeo Rizzi. 2001. Some simple distributed algorithms for sparse networks. Distributed computing 14, 2 (2001), 97--100."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/182338.182345"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","location":"Orlando FL USA","acronym":"PODC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":28,"alternative-id":["10.1145\/3583668.3594594","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594594","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}