Optimal Message-Passing with Noisy Beeps-Reference-Cited by-同舟云学术

Optimal Message-Passing with Noisy Beeps

Published:2023-06-16 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Davies Peter¹^ORCID

Affiliation:

1. Computer Science, Durham University, Durham, United Kingdom

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583668.3594594

Reference28 articles.

1. 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. 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.

2. A Biological Solution to a Fundamental Distributed Computing Problem

3. 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. 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.

4. Noisy beeping networks

5. The locality of distributed symmetry breaking;Barenboim Leonid;Journal of the ACM (JACM),2016

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Content-Oblivious Leader Election on Rings;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Non-negotiating Distributed Computing;Lecture Notes in Computer Science;2024

3. Optimal Message-Passing with Noisy Beeps;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16