Bounds on Optimal Merge Performance, and a Strategy for Optimality
- 1 October 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (4) , 641-648
- https://doi.org/10.1145/321724.321729
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Length of strings for a merge sortCommunications of the ACM, 1963
- InequalitiesPublished by Springer Nature ,1961
- Sorting, trees, and measures of orderInformation and Control, 1958
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952