Distributed computation with continual population growth

DOI10.1007/s00446-021-00404-8OpenAlexW3211253375MaRDI QIDQ2104041

Da-Jung Cho, Manish Kushwaha, Quentin Soubeyran, Matthias Függer, Thomas Nowak, Corbin Hopper

Publication date: 9 December 2022

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.09972

zbMATH Keywords

birth-death processesmajority consensusmicrobiological circuits

Mathematics Subject Classification ID

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

Uses Software

• COPASI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic function computation with chemical reaction networks
• A simple population protocol for fast robust approximate majority
• Extinction times and size of the surviving species in a two-species competition process
• Computation with finite stochastic chemical reaction networks
• Competition between two species
• Simplifying analyses of chemical reaction networks for approximate majority
• The computational power of population protocols
• Time-space trade-offs in population protocols for the majority problem
• A survey of size counting in population protocols
• Fast computation by population protocols with a leader
• Polya Urn Models
• On competition between two species
• Markov Chains
• Discrete Mathematics
• A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
• Population Stability
• Branching Processes Since 1873
• AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States

This page was built for publication: Distributed computation with continual population growth