Simple and Efficient Leader Election

DOI10.4230/OASIcs.SOSA.2018.9zbMath1433.68053OpenAlexW2784304773MaRDI QIDQ5240424

Dominik Kaaser, Peter Kling, Petra Berenbrink, Lena Otterbach

Publication date: 25 October 2019

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8302/pdf/OASIcs-SOSA-2018-9.pdf/

zbMATH Keywords

leader electionpopulation protocolsdistributedrandomized

Mathematics Subject Classification ID

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

Related Items (5)

ppsim: a software package for efficiently simulating and visualizing population protocols ⋮ Distributed computation of exact average degree and network size in finite time under quantized communication ⋮ Unnamed Item ⋮ A survey of size counting in population protocols ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time

Cites Work

• Unnamed Item
• Unnamed Item
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Polylogarithmic-Time Leader Election in Population Protocols
• Stably computable predicates are semilinear
• Brief Announcement
• Probability and Computing
• Stable leader election in population protocols requires linear time

This page was built for publication: Simple and Efficient Leader Election