|
114
|
A logarithmic time sort for linear size networks
– H J Reif, L G Valiant
- 1987
|
|
430
|
Sorting networks and their applications
– K. E. Batcher
- 1968
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– F T Leighton
- 1992
|
|
70
|
Parallel permutation and sorting algorithms and a new generalized connection network
– D Nassimi, S Sahni
- 1982
|
|
163
|
Tight bounds on the complexity of parallel sorting
– F T Leighton
- 1985
|
|
104
|
Sorting in c log n parallel steps
– M Ajtai, J Komlós, E Szemerédi
- 1983
|
|
22
|
Efficient Computation on Sparse Interconnection Networks
– C G Plaxton
- 1989
|
|
18
|
A (fairly) simple circuit that (usually) sorts, in
– T Leighton, C G Plaxton
- 1990
|
|
13
|
Network complexity of sorting and graph problems and simulating CRCW PRAMs by interconnection networks
– A Aggarwal, M-D A Huang
|
|
45
|
Parallel Sorting and Data Partitioning by Sampling
– J S Huang, Y C Chow
- 1983
|
|
43
|
Samplesort: A sampling approach to minimal storage tree sorting
– W D Frazer, A C McKellar
- 1970
|
|
219
|
Universal schemes for parallel communication
– L G Valiant, G J Brebner
- 1981
|
|
11
|
Cubesort: A parallel algorithm for sorting N data items with S-sorters
– R Cypher, J L C Sanz
- 1992
|
|
281
|
Parallel merge sort
– R Cole
|
|
78
|
Parallel Sorting Algorithms
– S G Akl
- 1985
|
|
234
|
Vector models for data-parallel computing
– G E Blelloch
- 1990
|
|
8
|
Binsorting on hypercubes with d-port communication
– S R Seidel, W L George
- 1988
|
|
32
|
Optimal sorting algorithms for parallel computers
– G Baudet, D Stevenson
- 1978
|
|
15
|
Hyperquicksort-A fast sorting algorithm for hypercubes
– B Wagar
- 1987
|
