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

Authors:
Christos Kaklamanis;Danny Krizanc;Lata Narayanan;Thanasis Tsantilas
Affiliations:
Aiken Computation Laboratory, Harvard University, Cambridge, MA;Dept. of Computer Science, University of Rochester, Rochester, NY;Dept. of Computer Science, University of Rochester, Rochester, NY;Dept. of Computer Science, Columbia University, New York, NY
Venue:
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Year:
1991

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
Sorting within distance bound on a mesh-connected processor array

Proceedings of the international symposium on Optimal algorithms
Randomized parallel selection (extended abstract)

FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Sorting on a mesh-connected parallel computer

Communications of the ACM

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
Optimal sorting on mesh-connected processor arrays

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for routing and sorting on multi-dimensional meshes

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel sorting by over partitioning

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Derandomizing algorithms for routing and sorting on meshes

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer

IEEE Transactions on Parallel and Distributed Systems
Faster deterministic sorting through better sampling

Theoretical Computer Science

Hi-index	0.00