Complete graph identification in population protocols
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
- 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
- A time and space optimal stable population protocol solving exact majority
- AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States
- 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
- 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
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- scientific article; zbMATH DE number 7832754 (Why is no real title available?)
- scientific article; zbMATH DE number 7832755 (Why is no real title available?)
- Leader election requires logarithmic time in population protocols
- Loosely-stabilizing leader election in a population protocol model
- Mediated population protocols
- Near-Optimal Leader Election in Population Protocols on Graphs
- 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 local codes for distributed stable network construction
- Simple and fast approximate counting and leader election in populations
- Space-optimal counting in population protocols
- Stable leader election in population protocols requires linear time
- Stably computable predicates are semilinear
- The computational power of population protocols
- Time and space optimal counting in population protocols
- Time-space trade-offs in population protocols
- Time-space trade-offs in population protocols for the majority problem
- Uniform bipartition in the population protocol model with arbitrary graphs
This page was built for publication: Complete graph identification in population protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229644)
