Recent results in population protocols for exact majority and leader election
From MaRDI portal
Publication:5207878
Recommendations
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- Fast and exact majority in population protocols
- scientific article; zbMATH DE number 6850453
- Brief announcement: Fast approximate counting and leader election in populations
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
Cited in
(27)- Brief announcement: Fast approximate counting and leader election in populations
- Theory of reaction automata: a survey
- Time-space trade-offs in population protocols for the majority problem
- The complexity of verifying population protocols
- On parallel time in population protocols
- ppsim: a software package for efficiently simulating and visualizing population protocols
- Uniform bipartition in the population protocol model with arbitrary graphs
- Population protocols: beyond runtime analysis
- Fast and exact majority in population protocols
- Deterministic population protocols for exact majority and plurality
- Space-optimal proportion consensus with population protocols
- Leader election requires logarithmic time in population protocols
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Determining majority in networks with local interactions and very small local memory
- 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?)
- Expressive Power of Broadcast Consensus Protocols
- Fast and succinct population protocols for Presburger arithmetic
- Parameterized Analysis of Immediate Observation Petri Nets
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Message complexity of population protocols
- Verification of population protocols with unordered data
- Temporal hyperproperties for population protocols
- Near-optimal leader election in population protocols on graphs
- Efficient assignment of identities in anonymous populations
- The expressive power of population protocols with logarithmic space
- Time-optimal self-stabilizing leader election in population protocols
This page was built for publication: Recent results in population protocols for exact majority and leader election
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207878)
