Balanced routing: towards the distance bound on grids

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing

Lower bounds for sorting on mesh-connected architectures

Acta Informatica

Optimal sorting on multi-dimensionally mesh-connected computers

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87

Optimal routing algorithms for mesh-connected processor arrays (extended abstract)

VLSI Algorithms and Architectures

Routing and sorting on mesh-connected arrays (extended abstract)

VLSI Algorithms and Architectures

A 2n-2 step algorithm for routing in an nxn array with constant size queues

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Packet routing on grids of processors

Proceedings of the international symposium on Optimal algorithms

Average case analysis of greedy routing algorithms on arrays

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

A unified approach to off-line permutation routing on parallel networks

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

(k—k) Routing on multidimensional mesh-connected arrays

Journal of Parallel and Distributed Computing

Constant queue routing on a mesh

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science

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