On the public citation graph

Reachability in Restricted Chemical Reaction Networks

https://doi.org/10.2139/ssrn.4665761
0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-88869-7_27openalex-extracted
Programmability of Chemical Reaction Networks
inferredcites →https://doi.org/10.1007/978-3-642-32208-2_11openalex-extracted
Space and Energy Efficient Computation with DNA Strand Displacement Systems
inferredcites →https://doi.org/10.1007/bf00251438openalex-extracted
Prolegomena to the rational analysis of systems of chemical reactions II. Some addenda
inferredcites →https://doi.org/10.1007/bf00282276openalex-extracted
Prolegomena to the rational analysis of systems of chemical reactions
inferredcites →https://doi.org/10.1007/s00446-005-0138-3openalex-extracted
Computation in networks of passively mobile finite-state sensors
inferredcites →https://doi.org/10.1016/0020-0190(79)90023-1openalex-extracted
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
inferredcites →https://doi.org/10.1016/0304-3975(78)90036-1openalex-extracted
The covering and boundedness problems for vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-extracted
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-extracted
Parallel program schemata
inferredcites →https://doi.org/10.1073/pnas.0909380107openalex-extracted
DNA as a universal substrate for chemical kinetics
inferredcites →https://doi.org/10.1073/pnas.2111552119openalex-extracted
Programming and training rate-independent chemical reaction networks
inferredcites →https://doi.org/10.1109/focs52979.2021.00120openalex-extracted
Reachability in Vector Addition Systems is Ackermann-complete
inferredcites →https://doi.org/10.1109/focs52979.2021.00121openalex-extracted
The Reachability Problem for Petri Nets is Not Primitive Recursive
inferredcites →https://doi.org/10.1142/s0129054123470032openalex-extracted
PSPACE-Completeness of Reversible Deterministic Systems
inferredcites →https://doi.org/10.1145/1011767.1011810openalex-extracted
Computation in networks of passively mobile finite-state sensors
inferredcites →https://doi.org/10.1145/2554797.2554827openalex-extracted
Rate-independent computation in continuous chemical reaction networks
inferredcites →https://doi.org/10.1145/3464794openalex-extracted
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
inferredcites →https://doi.org/10.1145/800076.802477openalex-extracted
An algorithm for the general Petri net reachability problem
inferredcites →https://doi.org/10.4230/lipics.fun.2018.18openalex-extracted
Computational Complexity of Motion Planning of a Robot through Simple Gadgets
inferredcites →https://doi.org/10.48550/arxiv.2306.01193openalex-extracted
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-63742-1_11openalex-snapshot
On the Simulation Power of Surface Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-63742-1_18openalex-snapshot
Computing Threshold Circuits with Bimolecular Void Reactions in Step Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-81202-6_4openalex-snapshot
Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-15641-9_22openalex-snapshot
Reachability in Interactive Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-15641-9_25openalex-snapshot
Polynomial Simulations of CRN Models with Trimolecular Void Step-Cycle CRNs
inferred← citeshttps://doi.org/10.1089/cmb.2024.0521openalex-snapshot
Pathway Realizability in Chemical Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.