Seven-state solutions to the Firing Squad Synchronization Problem

Constructible functions in cellular automata and their applications to hierarchy results

Theoretical Computer Science

Smaller solutions for the firing squad

Theoretical Computer Science

Firing squad synchronization problem in number-conserving cellular automata

Fundamenta Informaticae - Special issue on cellular automata

An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry

On Time-Constructible Functions in One-Dimensional Cellular Automata

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

A 4-states algebraic solution to linear cellular automata synchronization

Information Processing Letters

About 4-States Solutions to the Firing Squad Synchronization Problem

ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry

Fast Synchronization in P Systems

Membrane Computing

A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach

Fundamenta Informaticae - Machines, Computations and Universality, Part I

A smallest five-state solution to the firing squad synchronization problem

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Simple new algorithms which solve the firing squad synchronization problem: a 7-states 4n-steps solution

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Smallest implementations of optimum-time firing squad synchronization algorithms for one-bit-communication cellular automata

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

On the complexity of network synchronization

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Firing Squad Synchronization Problem in Number-Conserving Cellular Automata

Fundamenta Informaticae - Cellular Automata