A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays

DOI10.1016/j.cnsns.2014.07.031zbMath1347.68251OpenAlexW1994989638MaRDI QIDQ907212

Hiroshi Umeo, Kinuo Nishide, Keisuke Kubo

Publication date: 25 January 2016

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2014.07.031

zbMATH Keywords

firing squad synchronization problemcellular automatonmulti-dimensional FSSP algorithm

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

FSSP Algorithms for 2D Rectangular Arrays. Recent Developments ⋮ Preface to the special issue NUMTA 2013

Cites Work

• A six-state minimal time solution to 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 8-state minimal time solution to the firing squad synchronization problem
• A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based
• An optimum solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• Unconventional Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays