An efficient solution of the firing mob problem

DOI10.1016/0304-3975(91)90267-6zbMath0745.68025OpenAlexW1988182292MaRDI QIDQ1183587

Simant Dube, Karel II Culik

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90267-6

zbMATH Keywords

synchronizationfinite bounded-degree networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Revisiting the cutting of the firing squad synchronization ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Network structure and the firing squad synchronization problem
• Topological transformations as a tool in the design of systolic networks
• A six-state minimal time solution to the Firing squad synchronization problem
• Variations of the firing squad problem and applications
• Cellular automata synchronization
• 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
• 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
• The firing squad synchronization problem for two-dimensional arrays
• A generalized firing squad problem

This page was built for publication: An efficient solution of the firing mob problem