Implementing partition on vector computers

Authors:
Markus Hegland
Affiliations:
Interdisciplinary Project Center for Supercomputing, Swiss Federal Institute of Technology
Venue:
ICS '91 Proceedings of the 5th international conference on Supercomputing
Year:
1991

Citing 9
Cited 0

Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge

BIT
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Implementing Quicksort programs

Communications of the ACM
Expected time bounds for selection

Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Communications of the ACM
Algorithm 63: partition

Communications of the ACM
Algorithm 65: find

Communications of the ACM
Parallel Sorting Algorithms

Parallel Sorting Algorithms
Handbook of Algorithms

Handbook of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract