Synchronizing square arrays in optimum-time
From MaRDI portal
Publication:2869786
DOI10.1080/03081079.2012.695901zbMath1277.68155OpenAlexW2152982141MaRDI QIDQ2869786
Publication date: 6 January 2014
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2012.695901
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)
Related Items (3)
Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ FSSP Algorithms for 2D Rectangular Arrays. Recent Developments ⋮ Characterization of nonlinear dynamic systems for engineering purposes – a partial review
Cites Work
- A six-state minimal time solution to the Firing squad synchronization problem
- On optimal solutions to the firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
- An optimum solution to the firing squad synchronization problem
- Two- and three-dimensional firing-squad synchronization problems
This page was built for publication: Synchronizing square arrays in optimum-time
