Pages that link to "Item:Q1339892"
From MaRDI portal
The following pages link to Traffic-light scheduling on the grid (Q1339892):
Displaying 7 items.
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Periodic gossiping in back-to-back trees (Q1363646) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- Near-optimal scheduling of distributed algorithms (Q2796236) (← links)
- (Q4353150) (← links)
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
- Computing the Optimal Longest Queue Length in Torus Networks (Q6488368) (← links)