On time optimal solutions of the firing squad synchronization problem for two-dimensional paths-Reference-Cited by-同舟云学术

On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

Published:2001-05 Issue:1-2 Volume:259 Page:129-143
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Kobayashi Kojiro

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference8 articles.

1. S. Even, A. Litman, P. Winkler, Computing with snakes in directed networks of automata, 31st FOCS, 1990, pp. 740–745.

2. On the minimal firing time of the firing squad synchronization problem for polyautomata networks;Kobayashi;Theoret. Comput. Sci.,1978

3. The firing squad synchronization problem for a class of polyautomata networks;Kobayashi;J. Comput. System Sci.,1978

4. K. Kobayashi, On time optimal solutions of the two-dimensional firing squad synchronization problem, in: T. Worsch, R. Vollmar (Ed.), Proc. MFCS’98 Satellite Workshop on Cellular Automata, August 25–27, Brno, Czech Republic, Universität Karlsruhe, Falultat für Informatik, Interner Bericht 19/98, 1998, pp. 17–26.

5. An overview of the firing squad synchronization problem;Mazoyer,1986

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The minimum firing time of the generalized firing squad synchronization problem for squares;Theoretical Computer Science;2014-08

2. Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem;Computing with New Resources;2014

3. On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks;SIAM Journal on Computing;2012-01

4. Different time solutions for the firing squad synchronization problem on basic grid networks;RAIRO - Theoretical Informatics and Applications;2006-04

5. On the Complexity of the “Most General” Firing Squad Synchronization Problem;STACS 2006;2006