This is a preview of subscription content, log in via an institution to check access.
References
S. S. Kislitsyn, “On the estimation of the smallest average number of pairwise comparisons required for the complete ordering of N objects of different weights,” Vestnik LGH, no. 1, 1962.
C. C. Gotlieb, Sorting on Computers, “ Communications of the ACM,” vol. 6, No. 5, 1963.
W. Lautz, Sortierverfahren für technishe Dual-Computer, “Elektronishe Datenverarbeitung,” vol. 5, no. 2, 3, 1963.
B. K. Betz, W. C. Carter, New Merge Sorting Techniques, 14th. Nat. Mt. ACM, Cambridge, Mass., 1959.
Harold H. Manker, Multiphase Sorting, “Communications ofthe ACM,” vol. 6, No. 5, 1963.
D. W. Malcolm, String Distribution for the Polyphase Sort, “Communications of the ACM,” vol. 6, No. 5, 1963.
R. L. Gilstad, Read-Backward Polyphase Sorting, “Communications of the ACM,” vol. 6, No. 5, 1963.
S. W. Reynolds, A. Generalized Polyphase Merge Algorithm, “Communications of the ACM,” vol. 4, No. 8, 1961.
E. P. Miles, Generalized Fibonacci Numbers and Associated Matrices, “Amer. Math. Month.,” vol. 67, October 1960.
A. Markov, Calculus of Finite Differences, Odessa, 1910.
Sobel Sheldon, Oscillating Sort—a New Sort Merging Technique, “Journal of the ACM,” vol. 9, No. 3, July 1962.
L. S. Lozinskii and S. B. Pogrebinskii, “On a high-speed sorting algorithm,” Kibernetika, no. 5, Kiev, 1965.
Additional information
Kibernetika, Vol. 4, No. 1, pp. 25–35, 1968
Rights and permissions
About this article
Cite this article
Lozinskii, L.S. An analysis of external merge sorting techniques. Cybern Syst Anal 4, 21–28 (1968). https://doi.org/10.1007/BF01074750
Issue Date:
DOI: https://doi.org/10.1007/BF01074750