The use of binary search trees in external distribution sorting
- 31 December 1984
- journal article
- Published by Elsevier in Information Processing & Management
- Vol. 20 (4) , 547-557
- https://doi.org/10.1016/0306-4573(84)90006-2
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Sorting of textual data bases: A variety generation approach to distribution sortingInformation Processing & Management, 1980
- MICROCOMPUTER-AIDED PRODUCTION OF INDEXESThe Indexer, 1979
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- SortingACM Computing Surveys, 1971
- Sorting in a paging environmentCommunications of the ACM, 1970
- Sorting, trees, and measures of orderInformation and Control, 1958
- Account Identification for Automatic Data ProcessingJournal of the ACM, 1957
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952