On the public citation graph
Critical properties of Rule 22 elementary cellular automata
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01033074openalex-snapshot
Long-range effects in an elementary cellular automaton
inferredcites →https://doi.org/10.1007/bf01033083openalex-snapshot
Fast algorithm for the simulation of Ising models
inferredcites →https://doi.org/10.1016/0167-2789(84)90248-3openalex-snapshot
Chaos and diffusion in deterministic cellular automata
inferredcites →https://doi.org/10.1016/0167-2789(84)90253-7openalex-snapshot
Simulating physics with cellular automata
inferredcites →https://doi.org/10.1016/0370-1573(79)90060-7openalex-snapshot
Scaling theory of percolation clusters
inferredcites →https://doi.org/10.1103/physreva.28.3666openalex-snapshot
New mechanism for deterministic diffusion
inferredcites →https://doi.org/10.1103/physrevd.35.683openalex-snapshot
Monte Carlo calculation for the effective couplings of Polyakov loops
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.1201/9780429494093-6openalex-snapshot
Two-Dimensional Cellular Automata
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-1-84996-217-9_15openalex-snapshot
LIFE with Short-Term Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-38700-5_12openalex-snapshot
Beyond Solvable Elementary Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-35866-4_33openalex-snapshot
Phase Transitions in the Computational Complexity of “Elementary” Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-94-017-1005-3_2openalex-snapshot
Automata Network Models of Interacting Populations
inferred← citeshttps://doi.org/10.1007/s10955-010-0103-9openalex-snapshot
The One-Dimensional Exactly 1 Cellular Automaton: Replication, Periodicity, and Chaos from Finite Seeds
inferred← citeshttps://doi.org/10.1016/0167-2789(91)90089-ropenalex-snapshot
Long-range correlations in chaotic cellular automata
inferred← citeshttps://doi.org/10.1016/0378-4371(90)90136-gopenalex-snapshot
Monte Carlo study of infinite-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.chaos.2025.116601openalex-snapshot
Impact of (a)synchronism on ECA: Towards a new classification
inferred← citeshttps://doi.org/10.1016/s0167-2789(96)00258-8openalex-snapshot
The topological skeleton of cellular automaton dynamics
inferred← citeshttps://doi.org/10.1016/s0378-4371(96)00273-7openalex-snapshot
Critical phenomena in an one-dimensional probabilistic cellular automation
inferred← citeshttps://doi.org/10.1016/s0378-4371(97)00310-5openalex-snapshot
Transients in a one-dimensional probabilistic cellular automaton
inferred← citeshttps://doi.org/10.1088/0305-4470/24/1/007openalex-snapshot
Topological classification of cellular automata
inferred← citeshttps://doi.org/10.1088/0305-4470/25/20/011openalex-snapshot
Adiabatic Liouvillean in the theory of diffusion-limited recombination. I
inferred← citeshttps://doi.org/10.1109/iwcfta.2009.52openalex-snapshot
Topological Chaos of Cellular Automata Rules
inferred← citeshttps://doi.org/10.25088/complexsystems.28.2.125openalex-snapshot
On Patterns and Dynamics of Rule 22 Cellular Automaton
inferred← citeshttps://doi.org/10.70675/71cb115fz686ez49d4zb0e9z72dd52c70a14openalex-snapshot
Universalité et complexité des automates cellulaires coagulants
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.