Brief Announcement

DOI10.1145/3087801.3087858zbMath1380.68036OpenAlexW2738922137MaRDI QIDQ5369002

Robert Elsässer, Tomasz Radzik, Colin Cooper, Andreas Bilke

Publication date: 11 October 2017

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

Full work available at URL: https://doi.org/10.1145/3087801.3087858

zbMATH Keywords

leader electionpopulation protocolsexact majority

Mathematics Subject Classification ID

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

Related Items (10)

ppsim: a software package for efficiently simulating and visualizing population protocols ⋮ Unnamed Item ⋮ On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Leader Election Requires Logarithmic Time in Population Protocols ⋮ Unnamed Item ⋮ Simple and Efficient Leader Election ⋮ A survey of size counting in population protocols ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time ⋮ A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

This page was built for publication: Brief Announcement