Matching the bisection bound for routing and sorting on the mesh

An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks

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

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

Multi-packet-routing on mesh connected arrays

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

Constant queue routing on a mesh

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

Randomized sorting and selection on mesh-connected processor arrays (preliminary version)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Concentrated regular data streams on grids: sorting and routing near to the bisection bound

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Randomised algorithms for packet routing on the mesh

Advances in parallel algorithms

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