Fringe analysis for Extquick: Anin situ distributive external sorting algorithm
- 1 June 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 92 (2) , 141-160
- https://doi.org/10.1016/0890-5401(91)90007-o
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Transforming Unbalanced Multiway trees into a practical external data structureActa Informatica, 1988
- Improving time and space efficiency in generalized binary search treesActa Informatica, 1987
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- Pracniques: MeansortCommunications of the ACM, 1983
- Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Algorithm 64: QuicksortCommunications of the ACM, 1961