State Complexity of Protocols with Leaders-Reference-Cited by-同舟云学术

State Complexity of Protocols with Leaders

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Leroux Jérôme¹

Affiliation:

1. LaBRI, CNRS, Univ. Bordeaux, Talence, France

Funder

Agence Nationale de la Recherche

Publisher

ACM

Link

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

Reference17 articles.

1. Dan Alistarh , James Aspnes , David Eisenstat , Rati Gelashvili , and Ronald L. Rivest . 2017. Time-Space Trade-offs in Population Protocols . In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 , Barcelona, Spain, Hotel Porta Fira, January 16--19, Philip N. Klein (Ed.). SIAM, 2560--2579. https://doi.org/10.1137/1.978161 1974 782.169 10.1137/1.9781611974782.169 Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, and Ronald L. Rivest. 2017. Time-Space Trade-offs in Population Protocols. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16--19, Philip N. Klein (Ed.). SIAM, 2560--2579. https://doi.org/10.1137/1.9781611974782.169

2. Computation in networks of passively mobile finite-state sensors

3. Computation in networks of passively mobile finite-state sensors

4. Stably computable predicates are semilinear

5. The computational power of population protocols

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

1. Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Brief Announcement: Population Protocols Decide Double-exponential Thresholds;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16