On the public citation graph
Synchronization of interacting automata
0 signed · 42 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.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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11494645_14openalex-snapshot
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
inferred← citeshttps://doi.org/10.1007/11560319_20openalex-snapshot
A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays
inferred← citeshttps://doi.org/10.1007/11861201_21openalex-snapshot
A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
inferred← citeshttps://doi.org/10.1007/3-540-19444-4_16openalex-snapshot
An overview of the firing squad synchronization problem
inferred← citeshttps://doi.org/10.1007/3-540-36190-1_3openalex-snapshot
GALA (Globally Asynchronous — Locally Arbitrary) Design
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_51openalex-snapshot
A Synchronization Problem on 1-Bit Communication Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-45830-1_7openalex-snapshot
An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_23openalex-snapshot
Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_211openalex-snapshot
Firing Squad Synchronization Problem in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_70openalex-snapshot
Firing Squad Synchronization Problem in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_211openalex-snapshot
Firing Squad Synchronization Problem in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_10openalex-snapshot
Time-Optimum Smaller-State Synchronizers for Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_14openalex-snapshot
Abstract Geometrical Computation for Black Hole Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_3openalex-snapshot
Algorithmic Tools on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12203-3_6openalex-snapshot
Problem Solving on One-Bit-Communication Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_211-4openalex-snapshot
Cellular Automata, Firing Squad Synchronization Problem in
inferred← citeshttps://doi.org/10.1007/978-3-642-33350-7_11openalex-snapshot
A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem
inferred← citeshttps://doi.org/10.1007/978-4-431-88981-6_20openalex-snapshot
A Synchronization Problem in Two-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1016/0020-0255(76)90051-7openalex-snapshot
Cellular automata synchronization
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90040-8openalex-snapshot
Time-optimal solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90036-fopenalex-snapshot
The synchronization of nonuniform networks of finite automata
inferred← citeshttps://doi.org/10.1016/b978-1-4832-3187-7.50019-2openalex-snapshot
INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.016openalex-snapshot
The minimum firing time of the generalized firing squad synchronization problem for squares
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.011openalex-snapshot
The firing squad synchronization problem on CA with multiple updating cycles
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90833-xopenalex-snapshot
Synchronization of growing cellular arrays
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90255-7openalex-snapshot
Synchronization of cellular arrays: The firing squad problem in two dimensions
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00191-8openalex-snapshot
Smaller solutions for the firing squad
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00084-9openalex-snapshot
On optimal solutions to the firing squad synchronization problem
inferred← citeshttps://doi.org/10.1109/aina.2012.39openalex-snapshot
Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays
inferred← citeshttps://doi.org/10.1109/icapp.1995.472302openalex-snapshot
Asynchronous interaction in massively parallel computing
inferred← citeshttps://doi.org/10.1109/icnc.2012.72openalex-snapshot
Recent Developments in Firing Squad Synchronization Algorithms: Smaller Solutions
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63506openalex-snapshot
The synchronization of nonuniform networks of finite automata
inferred← citeshttps://doi.org/10.1137/110821019openalex-snapshot
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
inferred← citeshttps://doi.org/10.1137/s0097539705447086openalex-snapshot
On the Complexity of Network Synchronization
inferred← citeshttps://doi.org/10.1145/349194.349202openalex-snapshot
A brief history of cellular automata
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09018openalex-snapshot
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines
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.