Additional Key Words and Phrases: algorithms, comparison, minimal storage, probability, Quicksort, random sample, sorting, tree sorting
Selected papers that cite this one
- G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. An experimental analysis of parallel sorting algorithms. Theory of Computing Systems, 31(2):135-167, March/April 1998.
- Michael T. Goodrich. Communication-efficient parallel sorting (preliminary version). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 247-256, Philadelphia, Pennsylvania, 22-24 May 1996.
- Thomas N. Hibbard. Some combinatorial properties of certain trees with applications to searching and sorting. Journal of the ACM, 9(1):13-28, January 1962.