On the public citation graph

Cellular graph automata

https://doi.org/10.1007/bfb0025742
0 signed · 33 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/3-540-08860-1_31openalex-snapshot
Parallel and nondeterministic time complexity classes
inferredcites →https://doi.org/10.1007/bf01691465openalex-snapshot
Graph property recognition machines
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50019-2openalex-snapshot
INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS
inferredcites →https://doi.org/10.1016/c2013-0-12434-8openalex-snapshot
Graph Theory and Computing
inferredcites →https://doi.org/10.1016/s0019-9958(75)90520-3openalex-snapshot
Web automata
inferredcites →https://doi.org/10.1016/s0022-0000(73)80029-7openalex-snapshot
Time bounded random access machines
inferredcites →https://doi.org/10.1016/s0022-0000(76)80037-2openalex-snapshot
A characterization of the power of vector machines
inferredcites →https://doi.org/10.1109/sfcs.1976.20openalex-snapshot
On parallelism in turing machines
inferredcites →https://doi.org/10.1109/swat.1974.20openalex-snapshot
On the power of multiplication in random access machines
inferredcites →https://doi.org/10.1109/tsmc.1975.5408418openalex-snapshot
Networks of Automata: Some Applications
inferredcites →https://doi.org/10.1145/321637.321644openalex-snapshot
On the Topological Properties of Quantized Spaces, I. The Notion of Dimension
inferredcites →https://doi.org/10.1145/322108.322119openalex-snapshot
Time Bounded Random Access Machines with Parallel Processing
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
inferredcites →https://doi.org/10.21236/ada058792openalex-snapshot
Cellular Graph Acceptors, 4.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-10856-4_107openalex-snapshot
On the constructive description of graph languages accepted by finite automata
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_53openalex-snapshot
Leader Election by d Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4020-9656-3_9openalex-snapshot
Importance of Input Classification to Graph Automata Simulations of Forest Cover Change in the Peruvian Amazon
inferred← citeshttps://doi.org/10.1007/978-1-4684-3893-2_4openalex-snapshot
Generalized Cellular Automata
inferred← citeshttps://doi.org/10.1007/bfb0000117openalex-snapshot
Cellular computers for parallel region-level image processing
inferred← citeshttps://doi.org/10.1007/s11047-015-9503-8openalex-snapshot
Emulating cellular automata in chemical reaction–diffusion networks
inferred← citeshttps://doi.org/10.1016/0020-0255(80)90024-9openalex-snapshot
Sequential and cellular graph automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.009openalex-snapshot
Leader election in plane cellular automata, only with left?right global convention
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90288-2openalex-snapshot
Cellular graph automata. I. basic concepts, graph property measurement, closure properties
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90296-1openalex-snapshot
Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)49464-xopenalex-snapshot
A Cellular Control Architecture for FMS
inferred← citeshttps://doi.org/10.1068/b33146openalex-snapshot
A Dynamic Graph Automata Approach to Modeling Landscape Change in the Andes and the Amazon
inferred← citeshttps://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferred← citeshttps://doi.org/10.1109/cmpeur.1993.289843openalex-snapshot
Factory-level supervision based on real-time cellular object architectures
inferred← citeshttps://doi.org/10.1109/eurbot.1996.551890openalex-snapshot
Cellular automata in robot path planning
inferred← citeshttps://doi.org/10.1109/mc.1983.1654162openalex-snapshot
Parallel Image Processing Using Cellular Arrays
inferred← citeshttps://doi.org/10.1145/579.585openalex-snapshot
Distributed algorithms for finding centers and medians in networks
inferred← citeshttps://doi.org/10.1145/62546.62568openalex-snapshot
Computing on an anonymous network
inferred← citeshttps://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
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.