Robustness of Expressivity in Chemical Reaction Networks
From MaRDI portal
Publication:2835703
DOI10.1007/978-3-319-43994-5_4zbMath1452.68074OpenAlexW2963996047MaRDI QIDQ2835703
Robert Brijder, David Doty, David Soloveichik
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/23151
Related Items
Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- Verification of population protocols
- Computation with finite stochastic chemical reaction networks
- On the reachability problem for 5-dimensional vector addition systems
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Semigroups, Presburger formulas, and languages
- Parallel program schemata
- Probability 1 Computation with Chemical Reaction Networks
- Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders
- Polylogarithmic-Time Leader Election in Population Protocols
- Time-Space Trade-offs in Population Protocols
- Leaderless Deterministic Chemical Reaction Networks
- Stably computable predicates are semilinear
- Stable leader election in population protocols requires linear time
