Logarithmic Expected-Time Leader Election in Population Protocol Model

DOI10.1145/3293611.3331585OpenAlexW2963679548MaRDI QIDQ5145180FDOQ5145180

Authors: Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa 

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.11309

Recommendations

• Polylogarithmic-time leader election in population protocols
• Leader election requires logarithmic time in population protocols
• scientific article; zbMATH DE number 7774291
• Loosely-stabilizing leader election in a population protocol model
• Loosely-stabilizing leader election in population protocol model
• Optimal time and space leader election in population protocols
• scientific article; zbMATH DE number 7561458
• Loosely-stabilizing leader election with polylogarithmic convergence time

zbMATH Keywords

leader electionpopulation protocols

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (4)

• A survey of size counting in population protocols
• The Power of Global Knowledge on Self-stabilizing Population Protocols
• Message complexity of population protocols
• Logarithmic expected-time leader election in population protocol model

This page was built for publication: Logarithmic Expected-Time Leader Election in Population Protocol Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145180)