Distributed computation with continual population growth
From MaRDI portal
Recommendations
Cites work
- A simple population protocol for fast robust approximate majority
- Approximate majority analyses using tri-molecular chemical reaction networks
- Branching Processes Since 1873
- Competition between two species
- Computation with finite stochastic chemical reaction networks
- Extinction times and size of the surviving species in a two-species competition process
- Fast computation by population protocols with a leader
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3164122 (Why is no real title available?)
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 3001399 (Why is no real title available?)
- scientific article; zbMATH DE number 3185292 (Why is no real title available?)
- Markov Chains
- On competition between two species
- Probability 1 computation with chemical reaction networks
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 Q6535004)