On the public citation graph

Gardens of Eden and Fixed Points in Sequential Dynamical Systems

0 signed · 67 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.1006/jcss.1995.1009openalex-snapshot
On the Computational Complexity of Finite Cellular Automata
inferredcites →https://doi.org/10.1006/jcss.1997.1535openalex-snapshot
Invertible Linear Cellular Automata overZm:
inferredcites →https://doi.org/10.1007/3-540-57163-9_35openalex-snapshot
One-way cellular automata on cayley graphs
inferredcites →https://doi.org/10.1007/bf01217347openalex-snapshot
Computation theory of cellular automata
inferredcites →https://doi.org/10.1016/0167-2789(90)90185-ropenalex-snapshot
Invertible cellular automata: A review
inferredcites →https://doi.org/10.1016/0304-3975(94)90236-4openalex-snapshot
One-way cellular automata on Cayley graphs
inferredcites →https://doi.org/10.1016/0304-3975(94)90244-5openalex-snapshot
Inversion of 2D cellular automata: some complexity results
inferredcites →https://doi.org/10.1016/s0020-0190(97)00110-5openalex-snapshot
Finite automata-models for the investigation of dynamical systems
inferredcites →https://doi.org/10.1016/s0022-0000(72)80009-6openalex-snapshot
Tessellations with local transformations
inferredcites →https://doi.org/10.1016/s0022-0000(72)80013-8openalex-snapshot
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
inferredcites →https://doi.org/10.1016/s0096-3003(97)10166-7openalex-snapshot
Elements of a theory of computer simulation I: Sequential CA over random graphs
inferredcites →https://doi.org/10.1016/s0096-3003(98)10114-5openalex-snapshot
Elements of a theory of simulation II: sequential dynamical systems
inferredcites →https://doi.org/10.1073/pnas.90.16.7716openalex-snapshot
Evolutionary games and computer simulations.
inferredcites →https://doi.org/10.1109/fscs.1990.89601openalex-snapshot
On the predictability of coupled automata: an allegory about chaos
inferredcites →https://doi.org/10.1112/s0024609397343616openalex-snapshot
DYNAMICAL SYSTEMS: STABILITY, SYMBOLIC DYNAMICS AND CHAOS
inferredcites →https://doi.org/10.1145/5001.5002openalex-snapshot
Proving liveness for networks of communicating finite state machines
inferredcites →https://doi.org/10.46298/dmtcs.2314openalex-snapshot
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
inferredcites →https://doi.org/10.48550/arxiv.cs/0101026openalex-snapshot
Deterministic computations whose history is independent of the order of asynchronous updating

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11560319_18openalex-snapshot
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
inferred← citeshttps://doi.org/10.1007/11758532_38openalex-snapshot
On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata
inferred← citeshttps://doi.org/10.1007/3-540-34874-3_14openalex-snapshot
Modeling and Simulation of Large Biological, Information and Socio-Technical Systems: An Interaction Based Approach
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_15openalex-snapshot
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_10openalex-snapshot
Agent Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/978-3-030-67318-5_23openalex-snapshot
On Efficiency and Predictability of the Dynamics of Discrete-Time Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_9openalex-snapshot
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_3openalex-snapshot
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-47103-7_7openalex-snapshot
On Simple Models of Associative Memory: Network Density Is Not Required for Provably Complex Behavior
inferred← citeshttps://doi.org/10.1007/978-3-319-64635-0_8openalex-snapshot
Boolean Network Models of Collective Dynamics of Open and Closed Large-Scale Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30479-1_89openalex-snapshot
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_10-5openalex-snapshot
Agent-Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/s00224-022-10111-xopenalex-snapshot
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
inferred← citeshttps://doi.org/10.1007/s00373-025-03008-2openalex-snapshot
Period-3 Orbits of Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Finite Fields
inferred← citeshttps://doi.org/10.1007/s11786-007-0038-yopenalex-snapshot
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
inferred← citeshttps://doi.org/10.1007/s12572-018-0237-6openalex-snapshot
Graphical dynamical systems and their applications to bio-social systems
inferred← citeshttps://doi.org/10.1007/s41745-021-00260-2openalex-snapshot
Agent-Based Computational Epidemiological Modeling
inferred← citeshttps://doi.org/10.1016/j.amc.2018.10.077openalex-snapshot
Solution to the predecessors and Gardens-of-Eden problems for synchronous systems over directed graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2019.05.048openalex-snapshot
Dynamical attraction in parallel network models
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129115openalex-snapshot
Multi-state sequential Boolean networks: An analysis of its combinatorial dynamics
inferred← citeshttps://doi.org/10.1016/j.cam.2018.08.015openalex-snapshot
Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113084openalex-snapshot
Enumerating periodic orbits in sequential dynamical systems over graphs
inferred← citeshttps://doi.org/10.1016/j.cnsns.2021.105966openalex-snapshot
Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.008openalex-snapshot
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2017.05.002openalex-snapshot
On periods and equilibria of computational sequential systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.006openalex-snapshot
Complexity of reachability problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.026openalex-snapshot
Predecessor existence problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.018openalex-snapshot
The predecessor-existence problem for k-reversible processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.040openalex-snapshot
Dichotomy results for fixed point counting in boolean dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.008openalex-snapshot
Inferring local transition functions of discrete dynamical systems from observations of system behavior
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.026openalex-snapshot
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
inferred← citeshttps://doi.org/10.1016/s0096-3003(01)00277-6openalex-snapshot
ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
inferred← citeshttps://doi.org/10.1080/00207160.2019.1647338openalex-snapshot
Attractors and transient in sequential dynamical systems
inferred← citeshttps://doi.org/10.1109/icsmc.2005.1571639openalex-snapshot
Cellular Automata for Distributed Computing: Models of Agent Interaction and Their Implications
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303188openalex-snapshot
Concurrency vs. sequential interleavings in 1-D threshold cellular automata
inferred← citeshttps://doi.org/10.1109/ipdps.2005.303openalex-snapshot
On Counting Fixed Point Configurations in Star Networks
inferred← citeshttps://doi.org/10.1109/wsc40007.2019.9004718openalex-snapshot
Validating Agent-Based Models of Large Networked Systems
inferred← citeshttps://doi.org/10.1142/9789812770998_0018openalex-snapshot
DICHOTOMY RESULTS FOR FIXED POINT COUNTING IN BOOLEAN DYNAMICAL SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0129054106004339openalex-snapshot
ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
inferred← citeshttps://doi.org/10.1155/2019/6280960openalex-snapshot
Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems
inferred← citeshttps://doi.org/10.21236/ada434354openalex-snapshot
A Parametric Model for Large Scale Agent Systems
inferred← citeshttps://doi.org/10.23638/dmtcs-19-3-10openalex-snapshot
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
inferred← citeshttps://doi.org/10.2478/amns.2018.2.00046openalex-snapshot
Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
inferred← citeshttps://doi.org/10.3390/math8091611openalex-snapshot
An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph
inferred← citeshttps://doi.org/10.4018/978-1-4666-1574-8.ch015openalex-snapshot
Cellular Automata Communication Models
inferred← citeshttps://doi.org/10.4018/jncr.2010070105openalex-snapshot
Cellular Automata Communication Models
inferred← citeshttps://doi.org/10.46298/dmtcs.2314openalex-snapshot
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
inferred← citeshttps://doi.org/10.46298/dmtcs.2757openalex-snapshot
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules
inferred← citeshttps://doi.org/10.5555/2772879.2773343openalex-snapshot
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates
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.