Sorting with minimum data movement

Aggarwal, 1987, A model for hierarchical memory, 305 Apers, 1978, Recursive samplesort, BIT, 18, 125, 10.1007/BF01931688 Blum, 1973, Time bounds for selection, J. Comput. System Sci., 7, 448, 10.1016/S0022-0000(73)80033-9 Floyd, 1964, Algorithm 245, Treesort, Comm. ACM, 7, 701, 10.1145/355588.365103 Floyd, 1975, Expected time bounds for selection, Comm. ACM, 18, 165, 10.1145/360680.360691 Frazer, 1970, Samplesort: A sampling approach to minimal storage tree sorting, J. Assoc. Comput. Mach., 17, 496, 10.1145/321592.321600 Friend, 1956, Sorting on electronic computers, J. Assoc. Comput. Mach., 3, 134, 10.1145/320831.320833 Gonnet, 1975, The Heap as a Data Structure Johnson, 1975, Priority queues with update and finding minimum spanning trees, Inform. Process. Lett., 4, 53, 10.1016/0020-0190(75)90001-0 Huang, 1988, Practical in-place merging, Comm. ACM, 31, 348, 10.1145/42392.42403 Knuth, 1973 Knuth, 1972, Mathematical analysis of algorithms, 19 Lai, 1988, Implicit selection, Vol. 318, 14 Munro, 1980, An implicit data structure supporting insertion, deletion, and search in O(lg2 n) time, J. Comput. System Sci., 21, 236, 10.1016/0022-0000(80)90037-9 Munro, 1989, Sorting with minimum data movement, Vol. 382, 552 Munro, 1990, Stable in situ sorting and minimum data movement, BIT, 30, 220, 10.1007/BF02017344 Postmus, 1983, An efficient dynamic selection method, Comm. ACM, 26, 878, 10.1145/182.358440 Raman, 1991, Sorting In-Place with Minimum Data Movement Slater, 1966 Tarjan, 1983, Data Structures and Network Algorithms Trabb Pardo, 1977, Stable sorting and merging with optimal space and time bounds, SIAM J. Comput., 6, 351, 10.1137/0206025 Paulik, 1990, Worst-case analysis of a generalized heapsort algorithm, Inform. Process. Lett., 36, 159, 10.1016/0020-0190(90)90086-D Williams, 1964, Algorithm 232, Heapsort, Comm. ACM, 7, 347, 10.1145/512274.512284