Two- and three-dimensional firing-squad synchronization problems

From MaRDI portal
Publication:4044470

DOI10.1016/S0019-9958(74)80055-0zbMath0292.94039WikidataQ29039369 ScholiaQ29039369MaRDI QIDQ4044470

Ilka Shinahr

Publication date: 1974

Published in: Information and Control (Search for Journal in Brave)



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (24)

THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGSSynchronization of 1-way connected processorsMinimum and non-Minimum Time Solutions to the Firing Squad Synchronization ProblemTime-Optimum Smaller-State Synchronizers for Cellular AutomataRevisiting the cutting of the firing squad synchronizationFSSP Algorithms for 2D Rectangular Arrays. Recent DevelopmentsAn intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problemA class of time-optimum FSSP algorithms for multi-dimensional cellular arraysTime-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary positionThe firing squad synchronization problem on CA with multiple updating cyclesA Compositional Approach to Synchronize Two Dimensional Networks of ProcessorsAn efficient solution of the firing mob problemThe synchronization of nonuniform networks of finite automataThe minimum firing time of the generalized firing squad synchronization problem for squaresA Seven-State Time-Optimum Square SynchronizerCellular automata synchronization(A-)synchronous (non)-deterministic cell spaces simulating each otherA New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving BasedGeneralized FSSP on Hexagonal Tiling: Towards Arbitrary Regular SpacesError detection and correction in firing squad synchronization problemNetwork structure and the firing squad synchronization problemDifferent time solutions for the firing squad synchronization problem on basic grid networksSynchronizing square arrays in optimum-timeThe firing squad synchronization problem with sub-generals




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