Brief announcement: Population protocols for leader election and exact majority with O(^2 n) states and O(^2n) convergence time
From MaRDI portal
Publication:5369002
DOI10.1145/3087801.3087858zbMATH Open1380.68036OpenAlexW2738922137MaRDI QIDQ5369002FDOQ5369002
Authors: Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik 
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
Recommendations
- Recent results in population protocols for exact majority and leader election
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Simple and fast approximate counting and leader election in populations
- Polylogarithmic-time leader election in population protocols
- Fast and exact majority in population protocols
Cited In (25)
- A survey of size counting in population protocols
- Brief announcement: Fast approximate counting and leader election in populations
- Large flocks of small birds: on the minimal size of population protocols
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\)
- The benefits of entropy in population protocols
- A simple population protocol for fast robust approximate majority
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Fast space optimal leader election in population protocols
- Polylogarithmic-time leader election in population protocols
- Title not available (Why is that?)
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Leader election requires logarithmic time in population protocols
- Simple and fast approximate counting and leader election in populations
- ppsim: a software package for efficiently simulating and visualizing population protocols
- Title not available (Why is that?)
- Fast and exact majority in population protocols
- Simple and fast approximate counting and leader election in populations
- Space-optimal proportion consensus with population protocols
- Message complexity of population protocols
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Logarithmic expected-time leader election in population protocol model
- Time-space trade-offs in population protocols for the majority problem
- Simple and Efficient Leader Election
- Recent results in population protocols for exact majority and leader election
This page was built for publication: Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369002)
