Time-space trade-offs in population protocols for the majority problem
From MaRDI portal
Publication:2025852
Recommendations
- Time-space trade-offs in population protocols
- scientific article; zbMATH DE number 6850453
- Fast and exact majority in population protocols
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Recent results in population protocols for exact majority and leader election
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 population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- A simple population protocol for fast robust approximate majority
- Brief Announcement
- 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
- Computation in networks of passively mobile finite-state sensors
- Convergence speed of binary interval consensus
- Determining majority in networks with local interactions and very small local memory
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Fast space optimal leader election in population protocols
- Recent results in population protocols for exact majority and leader election
- Stably computable predicates are semilinear
- The computational power of population protocols
- Time-space trade-offs in population protocols
Cited in
(13)- A survey of size counting in population protocols
- Distributed computation with continual population growth
- Fast and succinct population protocols for Presburger arithmetic
- Constant-space population protocols for uniform bipartition
- Protocols with constant local storage and unreliable communication
- Uniform bipartition in the population protocol model with arbitrary graphs
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- scientific article; zbMATH DE number 6851888 (Why is no real title available?)
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- On approximate majority and probabilistic time
- Privacy in population protocols with probabilistic scheduling
- Time-space trade-offs in population protocols
This page was built for publication: Time-space trade-offs in population protocols for the majority problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025852)
