Pages that link to "Item:Q1899217"
From MaRDI portal
The following pages link to A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217):
Displaying 11 items.
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Efficient delay routing (Q1128715) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
- Mesh permutation routing with locality (Q1199943) (← links)
- Packet Routing on grids of processors (Q1207327) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Analysis of permutation routing algorithms (Q1580969) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Optimal permutation routing for low-dimensional hypercubes (Q3057142) (← links)
- Optimal multi-packet routing on the torus (Q5056134) (← links)
