Pages that link to "Item:Q1149772"
From MaRDI portal
The following pages link to The firing squad synchronization problem for graphs (Q1149772):
Displaying 14 items.
- The bit complexity of the predecessor problem (Q287147) (← links)
- Bounding the firing synchronization problem on a ring (Q596090) (← links)
- Near-optimal radio use for wireless network synchronization (Q714765) (← links)
- Smaller solutions for the firing squad (Q1605305) (← links)
- Faster synchronization in P systems (Q1761716) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- The firing squad synchronization problem with sub-generals (Q2350603) (← links)
- A Compositional Approach to Synchronize Two Dimensional Networks of Processors (Q2729630) (← links)
- An Adaptive Algorithm for P System Synchronization (Q2890287) (← links)
- Deterministic and Energy-Optimal Wireless Synchronization (Q3095330) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- The wake up and report problem is time-equivalent to the firing squad synchronization problem (Q5138501) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5919570) (← links)
