Near-Optimal Leader Election in Population Protocols on Graphs

DOI10.1145/3519270.3538435arXiv2205.12597MaRDI QIDQ6202165

Dan Alistarh, Joel Rybicki, Unnamed Author

Publication date: 26 March 2024

Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsgraph algorithmsrandomized algorithmsleader electionpopulation protocols

Mathematics Subject Classification ID

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

This page was built for publication: Near-Optimal Leader Election in Population Protocols on Graphs