On the public citation graph
On the Convergence of Elementary Cellular Automata under Sequential Update Modes
0 signed · 25 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/978-3-642-40867-0_2openalex-snapshot
A Guided Tour of Asynchronous Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-642-40867-0_9openalex-snapshot
On the Convergence of Boolean Automata Networks without Negative Cycles
inferredcites →https://doi.org/10.1007/s11047-019-09743-9openalex-snapshot
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
inferredcites →https://doi.org/10.1007/s11047-019-09779-xopenalex-snapshot
About block-parallel Boolean networks: a position paper
inferredcites →https://doi.org/10.1016/0025-5564(74)90029-7openalex-snapshot
Cell space approaches in biomathematics
inferredcites →https://doi.org/10.1016/0167-2789(84)90245-8openalex-snapshot
Universality and complexity in cellular automata
inferredcites →https://doi.org/10.1016/0304-3975(87)90124-1openalex-snapshot
A six-state minimal time solution to the firing squad synchronization problem
inferredcites →https://doi.org/10.1016/j.biosystems.2009.03.006openalex-snapshot
On the robustness of update schedules in Boolean networks
inferredcites →https://doi.org/10.1016/j.chaos.2025.116601openalex-snapshot
Impact of (a)synchronism on ECA: Towards a new classification
inferredcites →https://doi.org/10.1016/j.dam.2010.10.010openalex-snapshot
Combinatorics on update digraphs in Boolean networks
inferredcites →https://doi.org/10.1016/j.ic.2021.104764openalex-snapshot
On the complexity of asynchronous freezing cellular automata
inferredcites →https://doi.org/10.1016/j.jcss.2006.03.006openalex-snapshot
Complexity of reachability problems for finite discrete dynamical systems
inferredcites →https://doi.org/10.1016/j.jocs.2024.102430openalex-snapshot
Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates
inferredcites →https://doi.org/10.1016/j.physd.2005.04.005openalex-snapshot
Ordered asynchronous processes in multi-agent systems
inferredcites →https://doi.org/10.1016/j.tcs.2006.05.036openalex-snapshot
Fully asynchronous behavior of double-quiescent elementary cellular automata
inferredcites →https://doi.org/10.1016/j.tcs.2015.09.014openalex-snapshot
PSPACE-completeness of majority automata networks
inferredcites →https://doi.org/10.1016/j.tcs.2022.05.024openalex-snapshot
Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures
inferredcites →https://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferredcites →https://doi.org/10.1016/s0167-739x(99)00045-xopenalex-snapshot
Lattice gases and cellular automata
inferredcites →https://doi.org/10.1016/s0304-3800(00)00294-5openalex-snapshot
A cellular automaton model for the effects of population movement and vaccination on epidemic propagation
inferredcites →https://doi.org/10.1016/s0304-3975(03)00049-5openalex-snapshot
A fast algorithm to generate necklaces with fixed content
inferredcites →https://doi.org/10.1080/0022250x.1971.9989791openalex-snapshot
The checkerboard model of social interaction
inferredcites →https://doi.org/10.1080/0022250x.1971.9989794openalex-snapshot
Dynamic models of segregation†
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.25088/complexsystems.16.1.1openalex-snapshot
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata
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.