Loosely-stabilizing leader election with polylogarithmic convergence time
From MaRDI portal
Publication:2285158
DOI10.1016/j.tcs.2019.09.034zbMath1436.68039OpenAlexW2912937100WikidataQ127201756 ScholiaQ127201756MaRDI QIDQ2285158
Hirotsugu Kakugawa, Toshimitsu Masuzawa, Fukuhito Ooshita, Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10090/
Related Items (4)
Leader Election Requires Logarithmic Time in Population Protocols ⋮ The Power of Global Knowledge on Self-stabilizing Population Protocols ⋮ A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States ⋮ Loosely-stabilizing maximal independent set algorithms with unreliable communications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On space complexity of self-stabilizing leader election in mediated population protocol
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Polylogarithmic-Time Leader Election in Population Protocols
- On Space and Time Complexity of Loosely-Stabilizing Leader Election
- Leader Election Requires Logarithmic Time in Population Protocols
- Simple and Efficient Leader Election
- Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers
- Brief Announcement
- Probability and Computing
- Stable leader election in population protocols requires linear time
This page was built for publication: Loosely-stabilizing leader election with polylogarithmic convergence time
