The firing squad synchronization problem for two-dimensional arrays
From MaRDI portal
Publication:4141167
DOI10.1016/S0019-9958(77)90273-XzbMath0364.94089OpenAlexW1976085479MaRDI QIDQ4141167
Publication date: 1977
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(77)90273-x
Related Items (13)
Synchronization of 1-way connected processors ⋮ On optimal solutions to the firing squad synchronization problem ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ The firing squad synchronization problem for graphs ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ An efficient solution of the firing mob problem ⋮ Firing squad synchronization problem in reversible cellular automata ⋮ The synchronization of nonuniform networks of finite automata ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ On the minimal firing time of the firing squad synchronization problem for polyautomata networks ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks
This page was built for publication: The firing squad synchronization problem for two-dimensional arrays
