Distributed computation with continual population growth
From MaRDI portal
Publication:2104041
DOI10.1007/S00446-021-00404-8OpenAlexW3211253375MaRDI QIDQ2104041FDOQ2104041
Authors: Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, Quentin Soubeyran 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete Mathematics
- 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?)
- Markov Chains
- A simple population protocol for fast robust approximate majority
- Polya Urn Models
- Extinction times and size of the surviving species in a two-species competition process
- Title not available (Why is that?)
- On competition between two species
- A survey of size counting in population protocols
- Time-space trade-offs in population protocols for the majority problem
- Competition between two species
- Branching Processes Since 1873
- Title not available (Why is that?)
- Simplifying analyses of chemical reaction networks for approximate majority
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Population stability. Regulating size in the presence of an adversary
- AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States
Cited In (3)
Uses Software
This page was built for publication: Distributed computation with continual population growth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104041)
