An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
New Bounds for Oblivious Mesh Routing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
| Hi-index | 0.00 |