A simple population protocol for fast robust approximate majority
From MaRDI portal
Recommendations
- A Simple Population Protocol for Fast Robust Approximate Majority
- Fast and exact majority in population protocols
- scientific article; zbMATH DE number 6850453
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
Cites work
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- scientific article; zbMATH DE number 3729228 (Why is no real title available?)
- scientific article; zbMATH DE number 52077 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Computation in networks of passively mobile finite-state sensors
- Differential equations for random processes and random graphs
- Fast Computation by Population Protocols with a Leader
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- The computational power of population protocols
Cited in
(52)- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Noisy rumor spreading and plurality consensus
- Step-by-step community detection in volume-regular graphs
- Uniform bipartition in the population protocol model with arbitrary graphs
- ppsim: a software package for efficiently simulating and visualizing population protocols
- Simple dynamics for plurality consensus
- Chemical reaction network designs for asynchronous logic circuits
- Limits for rumor spreading in stochastic populations
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- Synthesizing and tuning chemical reaction networks with specified behaviours
- Verifying polymer reaction networks using bisimulation
- Simplifying analyses of chemical reaction networks for approximate majority
- Approximate majority analyses using tri-molecular chemical reaction networks
- Early adapting to trends: self-stabilizing information spread using passive communication
- Mediated population protocols
- Space-optimal proportion consensus with population protocols
- Modular verification of chemical reaction network encodings via serializability analysis
- Message complexity of population protocols
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Asynchronous opinion dynamics in social networks
- Speed faults in computation by chemical reaction networks
- Verifying chemical reaction network implementations: a bisimulation approach
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Distributed Averaging in Opinion Dynamics
- Chemical reaction network designs for asynchronous logic circuits
- Verifying chemical reaction network implementations: a bisimulation approach
- Loosely-stabilizing leader election in a population protocol model
- A Simple Population Protocol for Fast Robust Approximate Majority
- Phase transition of the \(k\)-majority dynamics in biased communication models
- Time-space trade-offs in population protocols for the majority problem
- Population-induced phase transitions and the verification of chemical reaction networks
- Constant-space population protocols for uniform bipartition
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Modular verification of DNA strand displacement networks via serializability analysis
- Fault-tolerant simulation of population protocols
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- Fast and exact majority in population protocols
- Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions
- TTLed random walks for collaborative monitoring in mobile and social networks
- Computing with biological switches and clocks
- Robust biomolecular finite automata
- Distributed computation with continual population growth
- Determining majority in networks with local interactions and very small local memory
- A tight analysis of the parallel undecided-state dynamics with two colors
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Distributed computation with continual population growth
- Polylogarithmic-time leader election in population protocols
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Passively mobile communicating machines that use restricted space
- Fast computation by population protocols with a leader
- Data collection in population protocols with non-uniformly random scheduler
This page was built for publication: A simple population protocol for fast robust approximate majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352239)
