Loosely-stabilizing leader election with polylogarithmic convergence time
From MaRDI portal
Publication:2285158
DOI10.1016/J.TCS.2019.09.034zbMATH Open1436.68039OpenAlexW2912937100WikidataQ127201756 ScholiaQ127201756MaRDI QIDQ2285158FDOQ2285158
Authors: Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, 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/
Recommendations
- Loosely-stabilizing leader election in a population protocol model
- Loosely-stabilizing leader election in population protocol model
- On space and time complexity of loosely-stabilizing leader election
- Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers
- Leader election requires logarithmic time in population protocols
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Probability and Computing
- Loosely-stabilizing leader election in a population protocol model
- Fast and exact majority in population protocols
- Title not available (Why is that?)
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Title not available (Why is that?)
- Polylogarithmic-time leader election in population protocols
- On space complexity of self-stabilizing leader election in mediated population protocol
- On space and time complexity of loosely-stabilizing leader election
- Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers
- Fast space optimal leader election in population protocols
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- Leader election requires logarithmic time in population protocols
- Simple and Efficient Leader Election
Cited In (11)
- The Power of Global Knowledge on Self-stabilizing Population Protocols
- Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers
- Loosely-stabilizing leader election in population protocol model
- Leader election requires logarithmic time in population protocols
- Loosely-stabilizing leader election in a population protocol model
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
- On space and time complexity of loosely-stabilizing leader election
- Title not available (Why is that?)
- Loosely-stabilizing maximal independent set algorithms with unreliable communications
- Stabilizing leader election in partial synchronous systems with crash failures
- Logarithmic Expected-Time Leader Election in Population Protocol Model
This page was built for publication: Loosely-stabilizing leader election with polylogarithmic convergence time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285158)
