Optimal time and space leader election in population protocols

DOI10.1145/3357713.3384312OpenAlexW3016416987MaRDI QIDQ5144902

George Giakkoupis, Peter Kling, Petra Berenbrink

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02545348

zbMATH Keywords

leader electionpopulation protocolsstabilization time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (7)

ppsim: a software package for efficiently simulating and visualizing population protocols ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Unnamed Item ⋮ Running time analysis of broadcast consensus protocols ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ A survey of size counting in population protocols ⋮ On parallel time in population protocols

This page was built for publication: Optimal time and space leader election in population protocols