An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal sorting on multi-dimensionally mesh-connected computers
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Optimal routing algorithms for mesh-connected processor arrays (extended abstract)
VLSI Algorithms and Architectures
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Parallel routing on multi-dimensional grids of processors
Proceedings of the conference on CONPAR 88
Sorting on a mesh-connected parallel computer
Communications of the ACM
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The distance bound for sorting on mesh-connected processor arrays is tight
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Matching the bisection bound for routing and sorting on the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Scattering and Gathering Messages in Networks of Processors
IEEE Transactions on Computers
| Hi-index | 0.00 |