[1] |
H. Erkiö,On the worst case of Shellsort, Report C-1980-54, University of Helsinki, Department of Computer Science, 1980. · Zbl 0428.68071 |
[2] |
B. L. Golden,A statistical approach to the TSP, Networks 7,3 (1977), 209–225. · Zbl 0398.90103 · doi:10.1002/net.3230070303 |
[3] |
E. J. Gumbel,Statistics of Extremes, Columbia University Press, New York, 1958. · Zbl 0086.34401 |
[4] |
T. N. Hibbard,An empirical study of minimal storage sorting, Comm. ACM 6,5 (May 1963), 206–213. · Zbl 0112.08501 · doi:10.1145/366552.366557 |
[5] |
D. E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching (2nd printing). Addison-Wesley, 1975. |
[6] |
V. Pratt,Shellsort and sorting networks, Ph. D. Thesis. Stanford University, 1972. |
[7] |
D. L. Shell,A high-speed sorting procedure, Comm. ACM 2,7 (July 1959), 30–32. · doi:10.1145/368370.368387 |
[8] |
Yu. G. Stoyan and V. Z. Socolovsky,The minimization method for some permutation functionals, Information Processing Letters 8,2 (Feb. 1979), 110–111. · doi:10.1016/0020-0190(79)90157-1 |