Leaderless deterministic chemical reaction networks
type: Item
instance of: scholarly article
title: Leaderless deterministic chemical reaction networks
zbMATH Open document ID: 1415.68080
author: David Doty
author: Monir Hajiaghayi
published in: Natural Computing
publication date: 2019-07-08T00:00:00Z
full work available at URL: CaltechAUTHORS:20140530-105253322
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 7077549
zbMATH Keywords: chemical reaction network
zbMATH Keywords: leader election
zbMATH Keywords: semilinear function
zbMATH Keywords: time complexity
MaRDI profile type: Publication
OpenAlex ID: W2168988021
cites work: Computation in networks of passively mobile finite-state sensors
cites work: Stably computable predicates are semilinear
cites work: Fast computation by population protocols with a leader
cites work: Deterministic Function Computation with Chemical Reaction Networks
cites work: Rate-independent computation in continuous chemical reaction networks
cites work: Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
cites work: Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
cites work: Timing in chemical reaction networks
cites work: Semigroups, Presburger formulas, and languages
cites work: Chemical implementation of neural networks and Turing machines.
cites work: Computation with finite stochastic chemical reaction networks
cites work: Space and Energy Efficient Computation with DNA Strand Displacement Systems
cites work: Termination Problems in Chemical Kinetics
DOI: 10.1007/S11047-014-9435-8
description: scientific article; zbMATH DE number 7077549