A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based

DOI10.1007/978-3-642-21875-0_31zbMath1344.68159OpenAlexW12895550MaRDI QIDQ3091468

Takuya Yamawaki, Kinuo Nishide, Hiroshi Umeo

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_31

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

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

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
• An optimum solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
• Unconventional Computation
• Machines, Computations, and Universality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based