A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
From MaRDI portal
Publication:6202212
DOI10.1145/3583668.3594586arXiv2305.08375OpenAlexW4380881564MaRDI QIDQ6202212
Fukuhito Ooshita, Unnamed Author, Toshimitsu Masuzawa, Yuichi Sudo
Publication date: 26 March 2024
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.08375
Cites Work
- Loosely-stabilizing leader election in a population protocol model
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- On Space and Time Complexity of Loosely-Stabilizing Leader Election
- Self-stabilizing systems in spite of distributed control
- Time-Space Trade-offs in Population Protocols
- Space-Optimal Proportion Consensus with Population Protocols
- Self-Stabilizing Leader Election
- Determining Majority in Networks with Local Interactions and Very Small Local Memory
- Memory-efficient and self-stabilizing network RESET (extended abstract)
- Self-Stabilizing Leader Election in Regular Graphs
