A population protocol for exact majority with O(^5/3 n) stabilization time and ( n) states
From MaRDI portal
Publication:5090899
Recommendations
- 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
- scientific article; zbMATH DE number 6850453
- Recent results in population protocols for exact majority and leader election
- A simple population protocol for fast robust approximate majority
Cites work
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- A polylogarithmic gossip algorithm for plurality consensus
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- Computation in networks of passively mobile finite-state sensors
- Determining majority in networks with local interactions and very small local memory
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Fast space optimal leader election in population protocols
- Plurality consensus in arbitrary graphs: lessons learned from load balancing
- Time-space trade-offs in population protocols
Cited in
(15)- On parallel time in population protocols
- Uniform bipartition in the population protocol model with arbitrary graphs
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- A survey of size counting in population protocols
- Deterministic population protocols for exact majority and plurality
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- 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
- Time-space trade-offs in population protocols for the majority problem
- Fast and exact majority in population protocols
- A simple population protocol for fast robust approximate majority
- Distributed computation with continual population growth
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Recent results in population protocols for exact majority and leader election
- Data collection in population protocols with non-uniformly random scheduler
This page was built for publication: A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090899)
