Pages that link to "Item:Q1251898"
From MaRDI portal
The following pages link to The firing squad synchronization problem for a class of polyautomata networks (Q1251898):
Displaying 14 items.
- Bounding the firing synchronization problem on a ring (Q596090) (← links)
- Near-optimal radio use for wireless network synchronization (Q714765) (← 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)
- 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)
- Smaller solutions for the firing squad (Q1605305) (← links)
- The minimum firing time of the generalized firing squad synchronization problem for squares (Q2253198) (← links)
- An Adaptive Algorithm for P System Synchronization (Q2890287) (← links)
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem (Q3514634) (← links)
- The wake up and report problem is time-equivalent to the firing squad synchronization problem (Q5138501) (← links)
- On time optimal solutions of the firing squad synchronization problem for two-dimensional paths (Q5941273) (← links)
- Revisiting the cutting of the firing squad synchronization (Q6084230) (← links)
