Space-optimal proportion consensus with population protocols
From MaRDI portal
Publication:5045452
Recommendations
- scientific article; zbMATH DE number 6850453
- Fast and exact majority in population protocols
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- A simple population protocol for fast robust approximate majority
- Recent results in population protocols for exact majority and leader election
Cited in
(10)- Distributed probabilistic polling and applications to proportionate agreement
- Distributed computation with continual population growth
- Uniform bipartition in the population protocol model with arbitrary graphs
- Data collection in population protocols with non-uniformly random scheduler
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Listen to Your Neighbors: How (Not) to Reach a Consensus
- Stochastic analysis of average-based distributed algorithms
- The Power of Global Knowledge on Self-stabilizing Population Protocols
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\)
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
This page was built for publication: Space-optimal proportion consensus with population protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045452)