Pages that link to "Item:Q1770370"
From MaRDI portal
The following pages link to Optimal oblivious routing on \(d\)-dimensional meshes (Q1770370):
Displaying 11 items.
- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing (Q826097) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- Oblivious routing for LC permutations on hypercubes. (Q1606865) (← links)
- Oblivious routing algorithms on the mesh of buses (Q1974679) (← links)
- A lower bound for elementary oblivious routing on three-dimensional meshes (Q2729648) (← links)
- An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size (Q2775890) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- (Q4252322) (← links)
- Randomized Throughput-Optimal Oblivious Routing for Torus Networks (Q5274337) (← links)
- Optimal oblivious routing in polynomial time (Q5901088) (← links)
- Optimal oblivious reconfigurable networks (Q6083590) (← links)