Network structure and the firing squad synchronization problem
From MaRDI portal
Publication:1050112
DOI10.1016/0022-0000(83)90025-9zbMath0512.68037OpenAlexW2085819277MaRDI QIDQ1050112
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(83)90025-9
Related Items (4)
An Adaptive Algorithm for P System Synchronization ⋮ An efficient solution of the firing mob problem ⋮ Faster synchronization in P systems ⋮ Error detection and correction in firing squad synchronization problem
Cites Work
- Unnamed Item
- Cellular automata synchronization
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
- Two- and three-dimensional firing-squad synchronization problems
- Synchronization of growing cellular arrays
- A generalized firing squad problem
This page was built for publication: Network structure and the firing squad synchronization problem
