Composable computation in leaderless, discrete chemical reaction networks
From MaRDI portal
Publication:6079210
Recommendations
Cites work
- A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities
- Composable Computation in Discrete Chemical Reaction Networks
- Composable rate-independent computation in continuous chemical reaction networks
- Computation with finite stochastic chemical reaction networks
- Deterministic function computation with chemical reaction networks
- Fast computation by population protocols with a leader
- Fast space optimal leader election in population protocols
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Leaderless deterministic chemical reaction networks
- Ordering by Divisibility in Abstract Algebras
- Output-oblivious stochastic chemical reaction networks
- Rate-independent computation in continuous chemical reaction networks
- Stably computable predicates are semilinear
- The computational power of population protocols
Cited in
(5)- Composable computation in discrete chemical reaction networks
- Output-oblivious stochastic chemical reaction networks
- Composable Computation in Discrete Chemical Reaction Networks
- Leaderless Deterministic Chemical Reaction Networks
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
This page was built for publication: Composable computation in leaderless, discrete chemical reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079210)
