On the public citation graph

Sequential Machines: Selected Papers

https://doi.org/10.2307/2004143

0 signed · 163 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470052105.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/j.2334-5837.1995.tb01912.xopenalex-snapshot

A Formalism for the Specification of Operationally Embedded Reactive Systems

inferred← citeshttps://doi.org/10.1007/1-4020-3817-8_1openalex-snapshot

Profinite semigroups and applications

inferred← citeshttps://doi.org/10.1007/11560319_15openalex-snapshot

On Formulations of Firing Squad Synchronization Problems

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/11591191_28openalex-snapshot

Experimental Evaluation of Classical Automata Constructions

inferred← citeshttps://doi.org/10.1007/11672142_57openalex-snapshot

On the Complexity of the “Most General” Firing Squad Synchronization Problem

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/11861201_22openalex-snapshot

State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata

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-27170-8_38openalex-snapshot

Efficient 1-Bit-Communication Cellular Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-28244-0_3openalex-snapshot

Specification of Requirements Models

inferred← citeshttps://doi.org/10.1007/3-540-36137-5_2openalex-snapshot

Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies

inferred← citeshttps://doi.org/10.1007/3-540-37619-4_18openalex-snapshot

A Comparative Investigation into Optimum-Time Synchronization Protocols for a Large Scale of One-Dimensional Cellular Automata

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-45132-3_18openalex-snapshot

Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints

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/3-540-53504-7_76openalex-snapshot

A logic-free method for modular composition of specifications

inferred← citeshttps://doi.org/10.1007/3-540-55092-5_11openalex-snapshot

Verification of a reliable net protocol

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-0-387-30440-3_528openalex-snapshot

Structurally Dynamic Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-0-387-73637-2_6openalex-snapshot

Autonomous DNA Models

inferred← citeshttps://doi.org/10.1007/978-1-4612-3040-3_4openalex-snapshot

Dynamic Templates and Semantic Rules for Simulation Advisors and Certifiers

inferred← citeshttps://doi.org/10.1007/978-1-4613-9730-4_8openalex-snapshot

Automatic Groups and Amalgams — A Survey

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_194openalex-snapshot

Structurally Dynamic 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-4615-6698-4_25openalex-snapshot

Executable Representation and Validation of SNA

inferred← citeshttps://doi.org/10.1007/978-1-4757-1895-9_24openalex-snapshot

Continuous Robot Motion Planning In Unknown Environment

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-030-02508-3_24openalex-snapshot

The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers

inferred← citeshttps://doi.org/10.1007/978-3-0348-5879-3_1openalex-snapshot

Über eine Darstellungstheorie Sequentieller Automaten

inferred← citeshttps://doi.org/10.1007/978-3-319-09063-4_20openalex-snapshot

FSSP Algorithms for Square and Rectangular Arrays

inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_3openalex-snapshot

Star-Free Languages and Local Divisors

inferred← citeshttps://doi.org/10.1007/978-3-319-10924-4_1openalex-snapshot

Algorithmic Insights into Finite-State Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_15openalex-snapshot

Experimental Finitization of Infinite Field-Based Generalized FSSP Solution

inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_9openalex-snapshot

Systolic Dissemination in the Arrowhead Family

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-319-13350-8_9openalex-snapshot

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-18812-6_7openalex-snapshot

Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces

inferred← citeshttps://doi.org/10.1007/978-3-319-21909-7_22openalex-snapshot

A Class of Non-optimum-time 3n-Step FSSP Algorithms - A Survey

inferred← citeshttps://doi.org/10.1007/978-3-319-26841-5_13openalex-snapshot

A Generalized Minimum-Time Minimum-State-Change FSSP Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-319-44365-2_14openalex-snapshot

A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-62932-2_22openalex-snapshot

A New Class of the Smallest Four-State Partial FSSP Solutions for One-Dimensional Ring Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_9openalex-snapshot

Smaller-State Implementations of 2D FSSP Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-30479-1_6openalex-snapshot

A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –

inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_44openalex-snapshot

On the Complexity of Network Synchronization

inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_18openalex-snapshot

Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays

inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_7openalex-snapshot

Permutations and Control Sets for Learning Non-regular Language Families

inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_25openalex-snapshot

A Smallest Five-State Solution to the Firing Squad Synchronization Problem

inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_27openalex-snapshot

Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution

inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_76openalex-snapshot

A New Time-Optimum Synchronization Algorithm for Two-Dimensional Cellular Arrays

inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_35openalex-snapshot

Church’s Problem and a Tour through Automata Theory

inferred← citeshttps://doi.org/10.1007/978-3-540-79992-4_14openalex-snapshot

About 4-States Solutions to the Firing Squad Synchronization Problem

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-15979-4_24openalex-snapshot

A Seven-State Time-Optimum Square Synchronizer

inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7_8openalex-snapshot

Cryptography with Constant Input Locality

inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_18openalex-snapshot

Nature-Based Problems in Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_31openalex-snapshot

A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based

inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_19openalex-snapshot

Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for 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-28024-5_11openalex-snapshot

An Adaptive Algorithm for P System Synchronization

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-3-642-33350-7_18openalex-snapshot

Recent Developments in Constructing Square Synchronizers

inferred← citeshttps://doi.org/10.1007/978-3-642-33350-7_3openalex-snapshot

Propagative Mode in a Lattice-Grain CA: Time Evolution and Timestep Synchronization

inferred← citeshttps://doi.org/10.1007/978-3-642-39958-9_35openalex-snapshot

An Isotropic Optimum-Time FSSP Algorithm for Two-Dimensional Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-77905-3_10openalex-snapshot

Some Inverse Problems

inferred← citeshttps://doi.org/10.1007/978-3-662-00784-6_9openalex-snapshot

Notes on Neural Computing

inferred← citeshttps://doi.org/10.1007/978-3-662-40087-6_1openalex-snapshot

On the Structure of Feasible Computations

inferred← citeshttps://doi.org/10.1007/978-3-662-45824-2_3openalex-snapshot

Logic-Automata Connections for Transformations

inferred← citeshttps://doi.org/10.1007/978-4-431-53868-4_38openalex-snapshot

A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm

inferred← citeshttps://doi.org/10.1007/978-4-431-53868-4_39openalex-snapshot

A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation

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.1007/978-94-011-1691-6_9openalex-snapshot

How to Fire Almost any Arbitrary Pattern on a Cellular Automaton

inferred← citeshttps://doi.org/10.1007/978-94-017-1253-8_8openalex-snapshot

Automata, Finite

inferred← citeshttps://doi.org/10.1007/bf01069830openalex-snapshot

Recognition of formal languages in one-dimensional iterative automata

inferred← citeshttps://doi.org/10.1007/bf01185865openalex-snapshot

Unison, canon, and sluggish clocks in networks controlled by a synchronizer

inferred← citeshttps://doi.org/10.1007/bf01691346openalex-snapshot

Generalized finite automata theory with an application to a decision problem of second-order logic

inferred← citeshttps://doi.org/10.1007/bf01706094openalex-snapshot

A medvedev characterization of sets recognized by generalized finite automata

inferred← citeshttps://doi.org/10.1007/bf01840369openalex-snapshot

Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

inferred← citeshttps://doi.org/10.1007/bfb0013111openalex-snapshot

Basic techniques for two-way finite automata

inferred← citeshttps://doi.org/10.1007/bfb0023740openalex-snapshot

The algebraic feedback product of automata

inferred← citeshttps://doi.org/10.1007/bfb0028554openalex-snapshot

Inducing an order on cellular automata by a grouping operation

inferred← citeshttps://doi.org/10.1007/bfb0032024openalex-snapshot

Two-way automata with multiplicity

inferred← citeshttps://doi.org/10.1007/bfb0036192openalex-snapshot

Synchronization of 1-way connected processors

inferred← citeshttps://doi.org/10.1007/s00236-020-00391-6openalex-snapshot

A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$

inferred← citeshttps://doi.org/10.1007/s00446-003-0095-7openalex-snapshot

The wake up and report problem is time-equivalent to the firing squad synchronization problem

inferred← citeshttps://doi.org/10.1007/s10590-011-9097-6openalex-snapshot

GREAT: open source software for statistical machine translation

inferred← citeshttps://doi.org/10.1007/s10849-011-9140-2openalex-snapshot

Aural Pattern Recognition Experiments and the Subregular Hierarchy

inferred← citeshttps://doi.org/10.1007/s11047-017-9625-2openalex-snapshot

A design of generalized minimum-state-change FSSP algorithms and their implementations

inferred← citeshttps://doi.org/10.1007/s11047-017-9628-zopenalex-snapshot

Revisiting the cutting of the firing squad synchronization

inferred← citeshttps://doi.org/10.1007/s11241-020-09356-xopenalex-snapshot

Reaching self-stabilising distributed synchronisation with COTS Ethernet components: the WALDEN approach

inferred← citeshttps://doi.org/10.1007/springerreference_60700openalex-snapshot

Structurally Dynamic Cellular Automata

inferred← citeshttps://doi.org/10.1016/0020-0190(89)90134-8openalex-snapshot

Variations of the firing squad problem and applications

inferred← citeshttps://doi.org/10.1016/0020-0190(94)00185-2openalex-snapshot

The relativized relationship between probabilistically checkable debate systems, IP and PSPACE

inferred← citeshttps://doi.org/10.1016/0304-3975(82)90016-0openalex-snapshot

Partitioning a graph in O(¦A¦log2¦V¦)

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/0304-3975(90)90083-topenalex-snapshot

Sur les codes zigzag et leur décidabilité

inferred← citeshttps://doi.org/10.1016/0304-3975(92)00076-4openalex-snapshot

A universal cellular automaton in quasi-linear time and its S—m—n form

inferred← citeshttps://doi.org/10.1016/j.ipl.2008.01.009openalex-snapshot

A 4-states algebraic solution to linear cellular automata synchronization

inferred← citeshttps://doi.org/10.1016/j.ipl.2013.08.003openalex-snapshot

The firing squad synchronization problem with sub-generals

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.024openalex-snapshot

Complexity of multi-head finite automata: Origins and directions

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.038openalex-snapshot

Recurrence and transience for finite probabilistic tables

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.009openalex-snapshot

Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines

inferred← citeshttps://doi.org/10.1016/s0019-9958(67)90032-0openalex-snapshot

An 8-state minimal time solution to the firing squad synchronization problem

inferred← citeshttps://doi.org/10.1016/s0019-9958(68)90309-4openalex-snapshot

A generalized firing squad problem

inferred← citeshttps://doi.org/10.1016/s0019-9958(74)80055-0openalex-snapshot

Two- and three-dimensional firing-squad synchronization problems

inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90273-xopenalex-snapshot

The firing squad synchronization problem for two-dimensional arrays

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80025-xopenalex-snapshot

Reversibility and surjectivity problems of cellular automata

inferred← citeshttps://doi.org/10.1016/s0022-0000(67)80022-9openalex-snapshot

Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00176-6openalex-snapshot

Free profinite locally idempotent and locally commutative semigroups

inferred← citeshttps://doi.org/10.1016/s0076-5392(08)60134-4openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00073-2openalex-snapshot

Introduction to the special issue on 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.1016/s0304-3975(96)00098-9openalex-snapshot

Some decisional problems on rational relations

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00211-3openalex-snapshot

Linear speed-up for cellular automata synchronizers and applications

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00179-0openalex-snapshot

On the representation of finite deterministic 2-tape automata

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00332-1openalex-snapshot

On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

inferred← citeshttps://doi.org/10.1017/s0952675716000129openalex-snapshot

Computationally, tone is different

inferred← citeshttps://doi.org/10.1049/cce:20040413openalex-snapshot

Misunderstandings about state machines

inferred← citeshttps://doi.org/10.1080/00029890.1965.11970707openalex-snapshot

A Perspective View of Discrete Automata and Their Design

inferred← citeshttps://doi.org/10.1093/mnrasl/slz125openalex-snapshot

Machine learning and Kolmogorov analysis to reveal gravitational lenses

inferred← citeshttps://doi.org/10.1103/physreva.95.012331openalex-snapshot

Bounds on the speedup in quantum signaling

inferred← citeshttps://doi.org/10.1109/csfw.2001.930132openalex-snapshot

Noninterference equations for nondeterministic systems

inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015580openalex-snapshot

Determination of the topology of a directed network

inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot

Formal Languages: Origins and Directions

inferred← citeshttps://doi.org/10.1109/sfcs.1980.22openalex-snapshot

Hardware complexity and parallel computation

inferred← citeshttps://doi.org/10.1109/t-c.1970.223036openalex-snapshot

R-70-31 A Generalized Firing Squad Problem

inferred← citeshttps://doi.org/10.1109/tcom.1980.1094695openalex-snapshot

Executable Description and Validation of SNA

inferred← citeshttps://doi.org/10.1137/0221036openalex-snapshot

The Nilpotency Problem of One-Dimensional Cellular Automata

inferred← citeshttps://doi.org/10.1137/s0097539705447086openalex-snapshot

On the Complexity of Network Synchronization

inferred← citeshttps://doi.org/10.1142/9789812810168_0003openalex-snapshot

AUTOMATA THEORY: ITS PAST AND FUTURE

inferred← citeshttps://doi.org/10.1142/s0129626409000237openalex-snapshot

A FAMILY OF SMALLEST SYMMETRICAL FOUR-STATE FIRING SQUAD SYNCHRONIZATION PROTOCOLS FOR RING ARRAYS

inferred← citeshttps://doi.org/10.1145/1476589.1476625openalex-snapshot

The on-line firing squad simulator

inferred← citeshttps://doi.org/10.1145/157485.164585openalex-snapshot

Automatic functional test generation using the extended finite state machine model

inferred← citeshttps://doi.org/10.1145/1808885.1808891openalex-snapshot

SEIM

inferred← citeshttps://doi.org/10.1145/225871.225880openalex-snapshot

Automatic generation of functional vectors using the extended finite state machine model

inferred← citeshttps://doi.org/10.1145/3356392.3365220openalex-snapshot

Inferring Semantically Enriched Representative Trajectories

inferred← citeshttps://doi.org/10.1145/349194.349202openalex-snapshot

A brief history of cellular automata

inferred← citeshttps://doi.org/10.1145/356608.356610openalex-snapshot

A Programmer's View of Automata

inferred← citeshttps://doi.org/10.1145/362929.362976openalex-snapshot

Curriculum 68: Recommendations for academic programs in computer science

inferred← citeshttps://doi.org/10.1145/364005.364036openalex-snapshot

The place of logical design and switching theory in the computer curriculum

inferred← citeshttps://doi.org/10.1145/364139.364150openalex-snapshot

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

inferred← citeshttps://doi.org/10.1145/365559.366069openalex-snapshot

An undergraduate program in computer science—preliminary recommendations

inferred← citeshttps://doi.org/10.1145/365691.365962openalex-snapshot

Multi-tape and infinite-state automata—a survey

inferred← citeshttps://doi.org/10.1162/106365603322519260openalex-snapshot

A Derived Markov Process for Modeling Reaction Networks

inferred← citeshttps://doi.org/10.1371/journal.pntd.0001494openalex-snapshot

WormAssay: A Novel Computer Application for Whole-Plate Motion-based Screening of Macroscopic Parasites

inferred← citeshttps://doi.org/10.17638/00009817openalex-snapshot

Pattern formations with discrete waves and broadcasting sequences

inferred← citeshttps://doi.org/10.18260/1-2--335openalex-snapshot

The Game Of Life Workshop Reaching Out To High School Students With Disabilities

inferred← citeshttps://doi.org/10.25088/complexsystems.21.4.297openalex-snapshot

Initial-Condition Estimation in Network Synchronization Processes: Algebraic and Graphical Characterizations of the Estimator

inferred← citeshttps://doi.org/10.3233/fi-2000-423406openalex-snapshot

Formal Asynchronous Systems Modelling

inferred← citeshttps://doi.org/10.36819/sw23.010openalex-snapshot

Agent Based Simulation of Workers’ Behaviours Around Hazard Areas in Manufacturing Sites

inferred← citeshttps://doi.org/10.4018/978-1-4666-1574-8.ch003openalex-snapshot

Wave Propagation in Filamental Cellular Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1909.05406openalex-snapshot

Minimum firing times of firing squad synchronization problems for paths in grid spaces

inferred← citeshttps://doi.org/10.48550/arxiv.1909.05408openalex-snapshot

The firing squad synchronization problem for squares with holes

inferred← citeshttps://doi.org/10.48550/arxiv.1909.10125openalex-snapshot

Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0310003openalex-snapshot

The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0511044openalex-snapshot

Various Solutions to the Firing Squad Synchronization Problems

inferred← citeshttps://doi.org/10.5075/epfl-thesis-3226openalex-snapshot

Tissu numérique cellulaire à routage et configuration dynamiques

inferred← citeshttps://doi.org/10.5445/ir/1000070923openalex-snapshot

Cellular Automata on Group Sets

inferred← citeshttps://doi.org/10.5555/1761566.1761590openalex-snapshot

A comparative investigation into optimum-time synchronization protocols for a large scale of one dimensional cellular automata

inferred← citeshttps://doi.org/10.5555/545381.545458openalex-snapshot

The wake up and report problem is time-equivalent to the firing squad synchronization problem

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.