The firing squad synchronization problem for graphs
From MaRDI portal
Publication:1149772
DOI10.1016/0304-3975(81)90004-9zbMath0454.68041OpenAlexW1974003349MaRDI QIDQ1149772
Namio Honda, Yasuaki Nishitani
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90004-9
Related Items (14)
An Adaptive Algorithm for P System Synchronization ⋮ The bit complexity of the predecessor problem ⋮ Bounding the firing synchronization problem on a ring ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ Faster synchronization in P systems ⋮ Near-optimal radio use for wireless network synchronization ⋮ On the Microscopic View of Time and Messages ⋮ Near-optimal self-stabilising counting and firing squads ⋮ Deterministic and Energy-Optimal Wireless Synchronization ⋮ The firing squad problem revisited ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ The firing squad synchronization problem with sub-generals ⋮ Smaller solutions for the firing squad
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Synchronization of growing cellular arrays
- The firing squad synchronization problem for two-dimensional arrays
- A generalized firing squad problem
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
This page was built for publication: The firing squad synchronization problem for graphs
