The Power of Global Knowledge on Self-stabilizing Population Protocols

DOI10.1007/978-3-030-54921-3_14OpenAlexW3046302295MaRDI QIDQ5100963

Junya Nakamura, Yuichi Sudo, Yong-Hwan Kim, Toshimitsu Masuzawa, Masahiro Shibata

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Loosely-stabilizing leader election in a population protocol model
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• 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
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• Self-stabilizing systems in spite of distributed control
• Space-Optimal Proportion Consensus with Population Protocols
• Self-Stabilizing Leader Election
• Logarithmic Expected-Time Leader Election in Population Protocol Model
• Determining Majority in Networks with Local Interactions and Very Small Local Memory
• Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers

This page was built for publication: The Power of Global Knowledge on Self-stabilizing Population Protocols