The firing squad synchronization problem on Cayley graphs
From MaRDI portal
Publication:5915397
DOI10.1016/S0304-3975(00)00160-2zbMath0945.68135MaRDI QIDQ5915397
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ Elements of a theory of computer simulation. I
Cites Work
- Unnamed Item
- A six-state minimal time solution to the Firing squad synchronization problem
- Variations of the firing squad problem and applications
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- An 8-state minimal time solution to the firing squad synchronization problem
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- A generalized firing squad problem
This page was built for publication: The firing squad synchronization problem on Cayley graphs
