The minimum firing time of the generalized firing squad synchronization problem for squares
From MaRDI portal
Publication:2253198
DOI10.1016/j.tcs.2014.06.016zbMath1360.68613OpenAlexW2014605166MaRDI QIDQ2253198
Publication date: 25 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding the firing synchronization problem on a ring
- A 4-states algebraic solution to linear cellular automata synchronization
- Variations of the firing squad problem and applications
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- The firing squad synchronization problem for a class of polyautomata networks
- On the minimal firing time of the firing squad synchronization problem for polyautomata networks
- Seven-state solutions to the firing squad synchronization problem
- Smaller solutions for the firing squad
- An 8-state minimal time solution to the firing squad synchronization problem
- On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
- An optimum solution to the firing squad synchronization problem
- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
- Two- and three-dimensional firing-squad synchronization problems
- The firing squad synchronization problem for two-dimensional arrays
- Recent Developments in Constructing Square Synchronizers
- On the Complexity of Network Synchronization
- Unconventional Computation
- A generalized firing squad problem
- Synchronization of interacting automata
- Machines, Computations, and Universality
- On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
