Logarithmic expected-time leader election in population protocol model

DOI10.1007/978-3-030-34992-9_26MaRDI QIDQ6536340zbMATH OpenFDO

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

Publication date 19 April 2024

Mathematics Subject Classification ID

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

Recommendations

• Logarithmic Expected-Time Leader Election in Population Protocol Model
• Leader election requires logarithmic time in population protocols
• Optimal time and space leader election in population protocols

Cites work

• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• scientific article; zbMATH DE number 7561458 (Why is no real title available?)
• Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Fast space optimal leader election in population protocols
• Loosely-stabilizing leader election in a population protocol model
• Polylogarithmic-time leader election in population protocols
• Simple and fast approximate counting and leader election in populations
• Time-space trade-offs in population protocols

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 Q6536340)