A compositional approach to synchronize two-dimensional networks of processors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1192313 (Why is no real title available?)
- scientific article; zbMATH DE number 1869612 (Why is no real title available?)
- scientific article; zbMATH DE number 1886326 (Why is no real title available?)
- scientific article; zbMATH DE number 3237733 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A six-state minimal time solution to the Firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Firing squad synchronization problem in reversible cellular automata
- On optimal solutions to the firing squad synchronization problem
- The firing squad synchronization problem for graphs
- The firing squad synchronization problem for two-dimensional arrays
- The firing squad synchronization problem on Cayley graphs
- Two- and three-dimensional firing-squad synchronization problems
- Variations of the firing squad problem and applications
Cited in
(3)
This page was built for publication: A compositional approach to synchronize two-dimensional networks of processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729630)