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:68 - 10 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
516 Sorting networks and their applications – K. E. Batcher - 1968
1324 FT Introduction to parallel algorithms and architectures: arrays – Leighton
121 A logarithmic time sort for linear size networks – J H Reif, L G Valiant - 1987
171 Tight bounds on the complexity of parallel sorting – T Leighton
70 Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network – D Nassimi, S Sahni - 1982
114 Sorting in c log n parallel steps – M Ajtai, J Komlos, E Szemeredi - 1983
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
653 An Introduction to Parallel Algorithms – J Jaja - 1992