On the power of oracle ? for self-stabilizing leader election in population protocols

DOI10.1007/978-3-319-49259-9_3zbMATH Open1425.68027OpenAlexW2548186920MaRDI QIDQ2007882FDOQ2007882

Authors: J. Beauquier, Peva Blanchard, J. Burman, Oksana Denysyuk 

Publication date: 22 November 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-49259-9_3

Recommendations

• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Loosely-stabilizing leader election in population protocol model
• Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
• Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols
• Self-stabilizing leader election in optimal space under an arbitrary scheduler

zbMATH Keywords

leader electionself-stabilizationpopulation protocolsoraclesnetworks of mobile agents

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Clocked population protocols

This page was built for publication: On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007882)