Sublinear-time collision detection in population protocols with polynomially many states
From MaRDI portal
Cites work
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
- Computation in networks of passively mobile finite-state sensors
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
- Fast computation by population protocols with a leader
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- scientific article; zbMATH DE number 7774291 (Why is no real title available?)
- Leader election requires logarithmic time in population protocols
- Loosely-stabilizing leader election in a population protocol model
- Loosely-stabilizing leader election with polylogarithmic convergence time
- On Counting the Population Size
- On space and time complexity of loosely-stabilizing leader election
- Optimal time and space leader election in population protocols
- Polylogarithmic-time leader election in population protocols
- Self-Stabilizing Leader Election
- Self-Stabilizing Leader Election in Regular Graphs
- Simple and Efficient Leader Election
- Stable leader election in population protocols requires linear time
- Time-Optimal Self-Stabilizing Leader Election in Population Protocols
- Time-space trade-offs in population protocols
- Time-space trade-offs in population protocols for the majority problem
This page was built for publication: Sublinear-time collision detection in population protocols with polynomially many states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266649)
