Two- and three-dimensional firing-squad synchronization problems*,

https://doi.org/10.1016/S0019-9958(74)80055-0Get rights and content
Under an Elsevier user license
open archive

This paper generalizes the well known firing-squad synchronization problem to two- and three-dimensional arrays.

Minimum-time solutions are outlined for square, rectangular, and cubic arrays.

Cited by (0)

*

Technion Preprint Series No. MT-125.

This paper is part of the author's Ph.D. dissertation, performed under guidance of Professor M. Yoeli and Professor A. Paz.