Leader Election Requires Logarithmic Time in Population Protocols

DOI10.1142/S012962642050005XzbMath1490.68054arXiv1906.11121OpenAlexW3011831250MaRDI QIDQ5087070

Yuichi Sudo, Toshimitsu Masuzawa

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

leader electionpopulation protocolsstabilization time

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (3)

ppsim: a software package for efficiently simulating and visualizing population protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time

Cites Work

• Loosely-stabilizing leader election in a population protocol model
• Brief announcement: fast approximate counting and leader election in populations
• 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
• Polylogarithmic-Time Leader Election in Population Protocols
• Time-Space Trade-offs in Population Protocols
• Brief Announcement
• Probability and Computing
• Stable leader election in population protocols requires linear time
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Leader Election Requires Logarithmic Time in Population Protocols