The following pages link to (Q4252322):
Displaying 9 items.
- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing (Q826097) (← links)
- Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
- Optimal oblivious routing on \(d\)-dimensional meshes (Q1770370) (← links)
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217) (← links)
- Oblivious routing algorithms on the mesh of buses (Q1974679) (← links)
- A lower bound for elementary oblivious routing on three-dimensional meshes (Q2729648) (← links)
- New bounds for oblivious mesh routing (Q2755057) (← links)
- An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size (Q2775890) (← links)
- Efficient randomized routing algorithms on the two-dimensional mesh of buses (Q5941436) (← links)
