Fast and exact majority in population protocols
From MaRDI portal
Recommendations
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- scientific article; zbMATH DE number 6850453
- 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
Cites work
Cited in
(50)- Simplifying analyses of chemical reaction networks for approximate majority
- Time-space trade-offs in population protocols for the majority problem
- On parallel time in population protocols
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Fault-tolerant simulation of population protocols
- Running time analysis of broadcast consensus protocols
- A survey of size counting in population protocols
- Data collection in population protocols with non-uniformly random scheduler
- Loosely-stabilizing leader election with polylogarithmic convergence time
- On the necessary memory to compute the plurality in multi-agent systems
- Explicit and tight bounds of the convergence time of average-based population protocols
- Advances in parameterized verification of population protocols
- Population protocols: beyond runtime analysis
- Protocols with constant local storage and unreliable communication
- Mediated population protocols: leader election and applications
- Deterministic population protocols for exact majority and plurality
- Constant-space population protocols for uniform bipartition
- Large flocks of small birds: on the minimal size of population protocols
- Immediate observation in mediated population protocols
- A simple population protocol for fast robust approximate majority
- A Simple Population Protocol for Fast Robust Approximate Majority
- Time-space trade-offs in population protocols
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Stably Computing Order Statistics with Arithmetic Population Protocols
- Stochastic analysis of average-based distributed algorithms
- Automatic analysis of expected termination time for population protocols
- Space-optimal proportion consensus with population protocols
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Output-oblivious stochastic chemical reaction networks
- scientific article; zbMATH DE number 7561458 (Why is no real title available?)
- Noidy conmunixatipn: on the convergence of the averaging population protocol
- Determining majority in networks with local interactions and very small local memory
- Determining majority in networks with local interactions and very small local memory
- Brief Announcement
- Recent results in population protocols for exact majority and leader election
- 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 7651155 (Why is no real title available?)
- Brief Announcement: Fast Graphical Population Protocols
- scientific article; zbMATH DE number 7758322 (Why is no real title available?)
- Fast and succinct population protocols for Presburger arithmetic
- Approximate majority analyses using tri-molecular chemical reaction networks
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Fast plurality consensus in regular expanders
- Message complexity of population protocols
- Majority consensus thresholds in competitive Lotka-Volterra populations
- Game dynamics and equilibrium computation in the population protocol model
- The ``power of few phenomenon: the sparse case
- Complete graph identification in population protocols
- Title not available (Why is no real title available?)
This page was built for publication: Fast and exact majority in population protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796240)
