On Counting the Population Size

DOI10.1145/3293611.3331631OpenAlexW2963477229MaRDI QIDQ5145177FDOQ5145177

Authors: Petra Berenbrink, Dominik Kaaser, Tomasz Radzik 

Publication date: 20 January 2021

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

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

Recommendations

• A survey of size counting in population protocols
• Simple and fast approximate counting and leader election in populations
• Simple and fast approximate counting and leader election in populations
• Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
• Space-optimal counting in population protocols

zbMATH Keywords

population sizecountingpopulation protocols

Mathematics Subject Classification ID

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

Cited In (5)

• A survey of size counting in population protocols
• Residency index – a tool for measuring the population size
• Uniform bipartition in the population protocol model with arbitrary graphs
• On the Nonidentifiability of Population Sizes
• Message complexity of population protocols

This page was built for publication: On Counting the Population Size

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