On the public citation graph

Computations on one-dimensional cellular automata

https://doi.org/10.1007/bf02127801
0 signed · 31 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/bf00264617openalex-snapshot
On real-time cellular automata and trellis automata
inferredcites →https://doi.org/10.1016/0020-0190(89)90134-8openalex-snapshot
Variations of the firing squad problem and applications
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/0304-3975(92)90150-eopenalex-snapshot
A linear speed-up theorem for cellular automata
inferredcites →https://doi.org/10.1016/s0019-9958(66)90110-0openalex-snapshot
An optimum solution to the firing squad synchronization problem
inferredcites →https://doi.org/10.1016/s0019-9958(67)90032-0openalex-snapshot
An 8-state minimal time solution to the firing squad synchronization problem
inferredcites →https://doi.org/10.1016/s0019-9958(80)90164-3openalex-snapshot
One-way bounded cellular automata
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.1109/t-c.1969.222663openalex-snapshot
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
inferredcites →https://doi.org/10.1145/321281.321290openalex-snapshot
Generation of Primes by a One-Dimensional Real-Time Iterative Array

What points at this work

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

inferred← citeshttps://doi.org/10.1002/3527602968.ch4openalex-snapshot
Computation in Cellular Automata: A Selected Review
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_59openalex-snapshot
Cellular Automata, Universality of
inferred← citeshttps://doi.org/10.1007/978-1-4471-0129-1openalex-snapshot
Collision-Based Computing
inferred← citeshttps://doi.org/10.1007/978-1-4471-0129-1_9openalex-snapshot
Signals on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_29openalex-snapshot
Cellular Automata, Universality of
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_59openalex-snapshot
Universality of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_58openalex-snapshot
Collision-Based Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_6openalex-snapshot
Universalities in Cellular Automata*
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_12openalex-snapshot
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_1openalex-snapshot
An Introduction to Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_4openalex-snapshot
Computations on Grids
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.06.001openalex-snapshot
Abstract geometrical computation 8: Small machines, accumulations & rationality
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.021openalex-snapshot
Leader election on two-dimensional periodic cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00075-4openalex-snapshot
Reversible space–time simulation of cellular automata
inferred← citeshttps://doi.org/10.1023/a:1026604401265openalex-snapshot
Universal Dynamical Computation in Multidimensional Excitable Lattices
inferred← citeshttps://doi.org/10.1109/hpcsim.2011.5999908openalex-snapshot
Cellular automata and discrete geometry
inferred← citeshttps://doi.org/10.1109/sasow.2010.23openalex-snapshot
Massively Parallel Automata in Euclidean Space-Time
inferred← citeshttps://doi.org/10.1145/977091.977111openalex-snapshot
BLOB computing
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.112openalex-snapshot
Complexity classes on spatially periodic Cellular Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2315openalex-snapshot
Cellular Automata and Discrete Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1307.6468openalex-snapshot
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
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.