On the public citation graph

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.

0 signed · 65 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/aama.1998.0595openalex-snapshot
Acyclic Orientations of Random Graphs
inferredcites →https://doi.org/10.1006/inco.1997.2661openalex-snapshot
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
inferredcites →https://doi.org/10.1006/jcss.1995.1009openalex-snapshot
On the Computational Complexity of Finite Cellular Automata
inferredcites →https://doi.org/10.1007/3-540-32923-4_8openalex-snapshot
Communicating Finite-State Machines
inferredcites →https://doi.org/10.1007/3-540-44683-4_15openalex-snapshot
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
inferredcites →https://doi.org/10.1007/3-540-50728-0_32openalex-snapshot
NC-algorithms for graphs with small treewidth
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/3-540-61440-0_151openalex-snapshot
On the complexity of relational problems for finite state processes
inferredcites →https://doi.org/10.1016/0167-2789(90)90196-vopenalex-snapshot
Classifying circular cellular automata
inferredcites →https://doi.org/10.1016/0196-6774(86)90002-7openalex-snapshot
Planar 3DM is NP-complete
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
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/s0012-365x(00)00115-1openalex-snapshot
Discrete, sequential dynamical systems
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/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.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferredcites →https://doi.org/10.1023/a:1013640918785openalex-snapshot
Deadlock detection in communicating finite state machines by even reachability analysis
inferredcites →https://doi.org/10.1073/pnas.90.16.7716openalex-snapshot
Evolutionary games and computer simulations.
inferredcites →https://doi.org/10.1088/0951-7715/4/2/002openalex-snapshot
Generalized shifts: unpredictability and undecidability in dynamical systems
inferredcites →https://doi.org/10.1103/physrevlett.64.2354openalex-snapshot
Unpredictability and undecidability in dynamical systems
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.1109/icccn.1995.540187openalex-snapshot
Deadlock detection in communicating finite state machines by even reachability analysis
inferredcites →https://doi.org/10.1109/sfcs.1992.267761openalex-snapshot
Quadratic dynamical systems
inferredcites →https://doi.org/10.1109/simsym.2000.844922openalex-snapshot
Sequential dynamical systems and applications to simulations
inferredcites →https://doi.org/10.1137/0218057openalex-snapshot
On the Limit Sets of Cellular Automata
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0097539793243004openalex-snapshot
An Algebraic Model for Combinatorial Problems
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/5001.5002openalex-snapshot
Proving liveness for networks of communicating finite state machines
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.46298/dmtcs.2294openalex-snapshot
Gardens of Eden and Fixed Points in 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
inferredcites →https://doi.org/10.5555/365411.365757openalex-snapshot
Adversarial models in evolutionary game dynamics

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-44683-4_15openalex-snapshot
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
inferred← citeshttps://doi.org/10.1007/978-1-4020-9688-4openalex-snapshot
Fundamental Problems in Computing
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/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.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.tcs.2007.04.026openalex-snapshot
Predecessor existence problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.027openalex-snapshot
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
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.2018.08.026openalex-snapshot
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
inferred← citeshttps://doi.org/10.1080/00207160.2019.1647338openalex-snapshot
Attractors and transient in sequential dynamical systems
inferred← citeshttps://doi.org/10.1097/bpo.0000000000001170openalex-snapshot
Preface and Introduction
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.1371/journal.pone.0104087openalex-snapshot
Biological Time Series Analysis Using a Context Free Language: Applicability to Pulsatile Hormone Data
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.31234/osf.io/pk3xjopenalex-snapshot
A Ten-Year Prospectus for Mathematical Epidemiology
inferred← citeshttps://doi.org/10.3389/fpsyg.2023.986289openalex-snapshot
A 10-year prospectus for mathematical epidemiology
inferred← citeshttps://doi.org/10.3934/dcdss.2011.4.1533openalex-snapshot
Update sequence stability in graph dynamical systems
inferred← citeshttps://doi.org/10.4172/jcsb.1000209openalex-snapshot
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata
inferred← citeshttps://doi.org/10.46298/dmtcs.2294openalex-snapshot
Gardens of Eden and Fixed Points in 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/3091125.3091195openalex-snapshot
Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems
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.