Pages that link to "Item:Q4141167"
From MaRDI portal
The following pages link to The firing squad synchronization problem for two-dimensional arrays (Q4141167):
Displaying 13 items.
- Firing squad synchronization problem in reversible cellular automata (Q671532) (← links)
- The firing squad synchronization problem for graphs (Q1149772) (← links)
- An efficient solution of the firing mob problem (Q1183587) (← links)
- The synchronization of nonuniform networks of finite automata (Q1187031) (← links)
- (A-)synchronous (non)-deterministic cell spaces simulating each other (Q1253921) (← links)
- On the minimal firing time of the firing squad synchronization problem for polyautomata networks (Q1253922) (← links)
- On optimal solutions to the firing squad synchronization problem (Q1349868) (← links)
- The minimum firing time of the generalized firing squad synchronization problem for squares (Q2253198) (← links)
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- Synchronization of 1-way connected processors (Q5055943) (← links)
- Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces (Q5501615) (← links)
