Dynamic size counting in population protocols

DOI10.4230/LIPICS.SAND.2022.13MaRDI QIDQ7395548zbMATH OpenFDO

Authors David Doty, Mahsa Eftekhari

Publication date 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAND.2022.13

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
• A survey of size counting in population protocols
• AnO(log^3/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
• Comparison Dynamics in Population Protocols
• Computation in networks of passively mobile finite-state sensors
• Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• scientific article; zbMATH DE number 7561458 (Why is no real title available?)
• scientific article; zbMATH DE number 7774291 (Why is no real title available?)
• Logarithmic expected-time leader election in population protocol model
• Loosely-stabilizing leader election in population protocol model
• 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
• Population stability. Regulating size in the presence of an adversary
• Probabilistic counting algorithms for data base applications
• Reversal of Markov Chains and the Forget Time
• Robust detection in leak-prone population protocols
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Simple and Efficient Leader Election
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks
• Space-optimal counting in population protocols
• The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
• Time and space optimal counting in population protocols
• Time-Optimal Self-Stabilizing Leader Election in Population Protocols
• Time-space trade-offs in population protocols
• Universal protocols for information dissemination using emergent signals

This page was built for publication: Dynamic size counting in population protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395548)