Composable Computation in Discrete Chemical Reaction Networks

DOI10.1145/3293611.3331615OpenAlexW2963640111MaRDI QIDQ5145173FDOQ5145173

David Doty, David K. Haley, Eric E. Severson

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

chemical reaction networksemilinearpopulation protocolcomposable computation

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (10)

• Speed Faults in Computation by Chemical Reaction Networks
• Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
• Deterministic Function Computation with Chemical Reaction Networks
• Decomposition and factorization of chemical reaction transducers
• Title not available (Why is that?)
• Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
• Title not available (Why is that?)
• Composable computation in discrete chemical reaction networks
• Title not available (Why is that?)
• Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks

This page was built for publication: Composable Computation in Discrete Chemical Reaction Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145173)