Timing in chemical reaction networks

DOI10.1137/1.9781611973402.57zbMath1421.68048arXiv1304.0872OpenAlexW1676436804MaRDI QIDQ5384018

David Doty

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0872

Mathematics Subject Classification ID

Related Items (22)

Simple and fast approximate counting and leader election in populations ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Speed faults in computation by chemical reaction networks ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ Unnamed Item ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ On the transformation capability of feasible mechanisms for programmable matter ⋮ Connectivity preserving network transformers ⋮ Leaderless deterministic chemical reaction networks ⋮ Unnamed Item ⋮ Stable leader election in population protocols requires linear time ⋮ Connectivity Preserving Network Transformers ⋮ Simple and efficient local codes for distributed stable network construction ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ The Synergy of Finite State Machines ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ How many cooks spoil the soup? ⋮ A Survey on Analog Models of Computation

This page was built for publication: Timing in chemical reaction networks