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

DOI10.1016/S0304-3975(99)00332-1zbMath0973.68157OpenAlexW1986805697WikidataQ127191048 ScholiaQ127191048MaRDI QIDQ5941273

Kojiro Kobayashi

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00332-1

zbMATH Keywords

firing squad synchronization problemnetwork algorithms

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ The firing squad synchronization problem for graphs ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks

Cites Work

• A six-state minimal time solution to the Firing squad synchronization problem
• The firing squad synchronization problem for a class of polyautomata networks
• On the minimal firing time of the firing squad synchronization problem for polyautomata networks
• Computing with Snakes in Directed Networks of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths