Speed faults in computation by chemical reaction networks
From MaRDI portal
(Redirected from Publication:1689751)
Recommendations
Cites work
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- A simple population protocol for fast robust approximate majority
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- Deterministic function computation with chemical reaction networks
- Fast computation by population protocols with a leader
- Leaderless Deterministic Chemical Reaction Networks
- Less haste, less waste: on recycling and its limits in strand displacement systems
- On the reachability problem for 5-dimensional vector addition systems
- Parallel program schemata
- Probability 1 computation with chemical reaction networks
- Speed faults in computation by chemical reaction networks
- Stably computable predicates are semilinear
- Strand algebras for DNA computing
- Timing in chemical reaction networks
Cited in
(9)- Speed Faults in Computation by Chemical Reaction Networks
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Brief Announcement: Population Protocols Decide Double-exponential Thresholds
- Automatic analysis of expected termination time for population protocols
- Speed faults in computation by chemical reaction networks
- Robust detection in leak-prone population protocols
- Computing with chemical reaction networks: a tutorial
- Minimal output unstable configurations in chemical reaction networks and deciders
- Timing in chemical reaction networks
This page was built for publication: Speed faults in computation by chemical reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689751)
