Two- and three-dimensional firing-squad synchronization problems

Cited in

(24)

Network structure and the firing squad synchronization problem
Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
An efficient solution of the firing mob problem
The synchronization of nonuniform networks of finite automata
Cellular automata synchronization
(A-)synchronous (non)-deterministic cell spaces simulating each other
Error detection and correction in firing squad synchronization problem
The minimum firing time of the generalized firing squad synchronization problem for squares
The firing squad synchronization problem with sub-generals
A compositional approach to synchronize two-dimensional networks of processors
Synchronizing square arrays in optimum-time
Minimum and non-minimum time solutions to the firing squad synchronization problem
Time-optimum smaller-state synchronizers for cellular automata
A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
Different time solutions for the firing squad synchronization problem on basic grid networks
THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
The firing squad synchronization problem on CA with multiple updating cycles
A seven-state time-optimum square synchronizer
Synchronization of 1-way connected processors
FSSP algorithms for 2D rectangular arrays. Recent developments
Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
Revisiting the cutting of the firing squad synchronization
A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays

This page was built for publication: Two- and three-dimensional firing-squad synchronization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044470)