Simple and fast approximate counting and leader election in populations
From MaRDI portal
Publication:2139094
DOI10.1016/J.IC.2021.104698OpenAlexW3119807236MaRDI QIDQ2139094FDOQ2139094
Authors: Othon Michail, Michail Theofilatos, P. G. Spirakis 
Publication date: 17 May 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104698
Recommendations
- Simple and fast approximate counting and leader election in populations
- Brief announcement: Fast approximate counting and leader election in populations
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
- Polylogarithmic-time leader election in population protocols
- Simple and Efficient Leader Election
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Computing on an anonymous ring
- Computation with finite stochastic chemical reaction networks
- The computational power of population protocols
- Fast computation by population protocols with a leader
- Deterministic function computation with chemical reaction networks
- Title not available (Why is that?)
- Stably computable predicates are semilinear
- Distributed computation in dynamic networks
- Mediated population protocols
- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Passively mobile communicating machines that use restricted space
- Naming and counting in anonymous unknown dynamic networks
- Timing in chemical reaction networks
- Space-optimal counting in population protocols
- Time and space optimal counting in population protocols
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
- Mediated population protocols: leader election and applications
- Polylogarithmic-time leader election in population protocols
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Brief announcement: Fast approximate counting and leader election in populations
- On space complexity of self-stabilizing leader election in mediated population protocol
- Time-space trade-offs in population protocols
- Fast space optimal leader election in population protocols
- Title not available (Why is that?)
- How many cooks spoil the soup?
Cited In (5)
- A survey of size counting in population protocols
- Population stability. Regulating size in the presence of an adversary
- Brief announcement: Fast approximate counting and leader election in populations
- Simple and fast approximate counting and leader election in populations
- Message complexity of population protocols
This page was built for publication: Simple and fast approximate counting and leader election in populations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139094)
