Logarithmic expected-time leader election in population protocol model

DOI10.1007/978-3-030-34992-9_26zbMATH Open1543.68058MaRDI QIDQ6536340

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

Publication date: 19 April 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loosely-stabilizing leader election in a population protocol model
• 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
• Stable leader election in population protocols requires linear time
• Simple and fast approximate counting and leader election in populations

This page was built for publication: Logarithmic expected-time leader election in population protocol model