Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Complexity of pairwise shortest path routing in the grid
Theoretical Computer Science
Graphs partitioning: an optimal MIMD queueless routing for BPC-permutations on hypercubes
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
| Hi-index | 0.89 |