scientific article; zbMATH DE number 6850453
From MaRDI portal
Publication:4608038
Recommendations
- Space-optimal proportion consensus with population protocols
- Time-space trade-offs in population protocols for the majority problem
- Space-optimal counting in population protocols
- Time and space optimal counting in population protocols
- Time-space trade-offs in population protocols
- Fast space optimal leader election in population protocols
- Space-optimal naming in population protocols
- Optimal time and space leader election in population protocols
- Fast and exact majority in population protocols
- Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
Cited in
(51)- Approaches to an occupancy problem resulting from MFSK systems with diversity and majority vote
- Time-space trade-offs in population protocols for the majority problem
- The complexity of verifying population protocols
- Composable computation in discrete chemical reaction networks
- How many cooks spoil the soup?
- Distributed computation with continual population growth
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Fault-tolerant simulation of population protocols
- Running time analysis of broadcast consensus protocols
- Uniform bipartition in the population protocol model with arbitrary graphs
- 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
- Noisy rumor spreading and plurality consensus
- Population protocols: beyond runtime analysis
- Fast and exact majority in population protocols
- Time and space optimal counting in population protocols
- Deterministic population protocols for exact majority and plurality
- 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
- Fast space optimal leader election in population protocols
- 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
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- Population stability. Regulating size in the presence of an adversary
- Brief announcement: Space-optimal naming in population protocols
- Recent results in population protocols for exact majority and leader election
- Simple and Efficient Leader Election
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- Expressive Power of Broadcast Consensus Protocols
- Composable computation in leaderless, discrete chemical reaction networks
- Parameterized Analysis of Immediate Observation Petri Nets
- Approximate majority analyses using tri-molecular chemical reaction networks
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Message complexity of population protocols
- Logarithmic expected-time leader election in population protocol model
- Majority consensus thresholds in competitive Lotka-Volterra populations
- Brief announcement: Optimally encoding information in chemical reaction networks
- Dynamic size counting in the population protocol model
- Game dynamics and equilibrium computation in the population protocol model
- An improved drift theorem for balanced allocations
- Balanced allocations with the choice of noise
- Rate-independent computation in continuous chemical reaction networks
- Complete graph identification in population protocols
- Sublinear-time collision detection in population protocols with polynomially many states
- The expressive power of population protocols with logarithmic space
- Time-optimal self-stabilizing leader election in population protocols
- Distributed majority consensus in synthetic microbial consortia with bursty gene expression
- Anonymous self-stabilising localisation via spatial population protocols
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608038)
