scientific article; zbMATH DE number 1305438
From MaRDI portal
Publication:4252322
Recommendations
- An O( N) oblivious routing algorithm for two-dimensional meshes of constant queue-size
- Optimal oblivious routing on \(d\)-dimensional meshes
- scientific article; zbMATH DE number 1863317
- Optimal many-to-one routing on the mesh with constant queues
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES
- A lower bound for elementary oblivious routing on three-dimensional meshes
- New bounds for oblivious mesh routing
- Shorter queues for permutation routing on meshes
- scientific article; zbMATH DE number 1222837
Cited in
(8)- Optimal oblivious routing on \(d\)-dimensional meshes
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- Oblivious routing algorithms on the mesh of buses
- A lower bound for elementary oblivious routing on three-dimensional meshes
- New bounds for oblivious mesh routing
- An O( N) oblivious routing algorithm for two-dimensional meshes of constant queue-size
- Efficient randomized routing algorithms on the two-dimensional mesh of buses
- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252322)
