A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
We consider the problem of self-stabilizing leader election in the population model by Angluin et al. (JDistComp '06). The population model is a well-established and powerful model for asynchronous, distributed computation with a large number of applications. For self-stabilizing leader election, the population of n anonymous agents, interacting in uniformly random pairs, must stabilize with a single leader from any possible initial configuration.
Authors
- Tom Friedetzky (ORCID: https://orcid.org/0000-0002-1299-5514)
- Thorsten Götte (ORCID: https://orcid.org/0000-0001-9798-6993)
- Lukas Hintze
- Petra Berenbrink (ORCID: https://orcid.org/0000-0002-6930-3259)
- Henry Austin
Institutions
- Universität Hamburg (DE)
- Durham University (GB)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733557
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Deutsche Forschungsgemeinschaft