References
- Balzer , R. 1967 . An Eight-State Minimal Time Solution to the Firing Squad Synchronization Problem . Information and Control , 10 : 22 – 42 .
- Beyer, W.T. (1969), ‘Recognition of Topological Invariants by Iterative Arrays,’ Ph.D. dissertation, MIT, p. 144
- Gerken , Hans-D. 1987 . Über Synchronisations – Probleme bei Zellularautomaten. Diplomarbeit , 50 Institut für Theoretische Informatik, Technische Universität Braunschweig .
- Goto , E. 1962 . A Minimal Time Solution of the Firing Squad Problem. Dittoed Course Notes for Applied Mathematics 298 , 52 – 59 . Massachusetts : Harvard University .
- Gruska , J. , Torre , S.L. and Parente , M. 2007 . The Firing Squad Synchronization Problem on Squares, Toruses and Rings . Intern. J. of Foundations of Computer Science , 18 ( 3 ) : 637 – 654 .
- Ishii, S., Yanase, H., Maeda, M., and Umeo, H. (2006), ‘State-Efficient Implementations of Time-Optimum Synchronization Algorithms for Square Arrays,’ IEICE Technical Report, CAS 2005-72, pp. 13–18
- Mazoyer , J. 1987 . A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem . Theoretical Computer Science , 50 : 183 – 238 .
- Mazoyer , J. 1996 . On Optimal Solutions to the Firing Squad Synchronization Problem . Theoretical Computer Science , 168 : 367 – 404 .
- Moore , E.F. 1964 . “ The Firing Squad Synchronization Problem ” . In Sequential Machines, Selected Papers , Edited by: Moore , E.F. 213 – 214 . Reading, MA : Addison-Wesley .
- Shinahr , I. 1974 . Two- and Three-Dimensional Firing Squad Synchronization Problems . Information and Control , 24 : 163 – 180 .
- Umeo , H. 2008 . Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata . Journal of Cellular Automata , 4 : 1 – 20 .
- Umeo , H. 2009 . “ Firing Squad Synchronization Problem in Cellular Automata ” . In Encyclopedia of Complexity and System Science , Edited by: Meyers , R.A. Vol. 4 , 3537 – 3574 . Springer .
- Umeo , H. , Hisaoka , M. and Akiguchi , S. 2005 . “ Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays ” . In Proceedings of 4th International Conference on Unconventional Computing: UC 2005, LNCS 3699 214 – 223 .
- Umeo , H. and Kubo , K. 2010 . “ A Seven-State Time-Optimum Square Synchronizer ” . In Proceedings of the 9th International Conference on Cellular Automata for Research and Industry, LNCS 6350 , 219 – 230 . Berlin, Heidelberg : Springer-Verlag .
- Umeo , H. , Maeda , M. and Fujiwara , N. 2002 . “ An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm Onto Two-Dimensional Arrays ” . In Proceedigns of the 5th International Conference on Cellular Automata for Research and Industry, LNCS 2493 , 69 – 81 . Berlin, Heidelberg : Springer-Verlag .
- Umeo , H. , Nishide , K. and Yamawaki , T. 2011a . “ A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays – One-Sided Recursive Halving Based ” . In Proceedings of the International Conference on Models of Computation in Context, Computability in Europe 2011, CiE 2011, LNCS 6735 Edited by: Löwe , B. 290 – 299 . Berlin, Heidelberg
- Umeo , H. , Uchino , H. and Nomura , A. 2011b . “ How to Synchronize Square Arrays in Optimum-Time ” . In Proceedings of the 2011 International Conference on High Performance Computing and Simulation (HPCS 2011) , Edited by: Samari , W.W. 801 – 807 . NJ, USA : IEEE .
- Umeo , H. and Yanagihara , H. 2011 . “ Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for One-Bit-Communication Cellular Automata ” . In Proceedings of the Parallel Computing Technology: PaCT 2011, LNCS 6873 , Edited by: Malyshkin , V. 210 – 223 . Berlin, Heidelberg : Springer-Verlag .
- Waksman , A. 1966 . An Optimum Solution to the Firing Squad Synchronization Problem . Information and Control , 9 : 66 – 78 .