Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (1996)

Cached

Download Links

by Robert Cypher , C. Greg Plaxton
Venue:Journal of Computer and System Sciences
Citations:67 - 10 self

Documents Related by Co-Citation

120 A logarithmic time sort for linear size networks – J H Reif, L G Valiant - 1987
501 Sorting networks and their applications – K. E. Batcher - 1968
1309 Introduction to Parallel Algorithms and Architectures: Arrays – F T Leighton - 1991
70 Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network – D Nassimi, S Sahni - 1982
168 Tight Bounds on the Complexity of Parallel Sorting – Tom Leighton - 1984
111 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
20 A (fairly) simple circuit that (usually) sorts – 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 - 1988
49 Parallel sorting and data partitioning by sampling – J S Huang, Y C Chow - 1983
50 Samplesort: A sampling approach to minimal storage tree sorting – W Frazer, A McKellar - 1970
249 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
288 Parallel Merge Sort – R Cole - 1988
84 Parallel Sorting Algorithms – S G Akl - 1989
259 Vector Models for Data-Parallel Computing – G E Blelloch - 1990
16 Hyperquicksort: A Fast Sorting Algorithm for Hypercubes, Hypercube Multiprocessors 1987 – B A Wagar - 1987
8 Binsorting on Hypercubes with d-port Communication – S R Seidel, W L George - 1988
35 Optimal Sorting Algorithms for Parallel Computer – G Baudet, D Stevenson - 1978