Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. A. Borodin and J. E. Hopcroft, “Routing, merging, and sorting on parallel models of computation,” J. Computer and System Sciences 30 (1985) 130–145.
2. A. Borodin, P. Raghavan, B. Schieber and E. Upfal, “How much can hardware help routing?,” In Proc. ACM Symposium on Theory of Computing (1993) 573–582.
3. M. Grammatikakis, D. Hsu, M. Kraetzl and J. Sibeyn, “Packet routing in fixedconnection networks: A survey,” manuscript (1998).
4. K. Iwama, Y. Kambayashi and E. Miyano, “New bounds for oblivious mesh routing,” In Proc. 6th European Symposium on Algorithms (1998) 295–306.
5. K. Iwama and E. Miyano, “An $$ O(\sqrt N )$$ oblivious routing algorithms for 2-D meshes of constant queue-size,” In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999) 466–475.