Shell, 1959
[16][16] D.L. Shell. A high-speed sorting procedure. Communications of the ACM, 2(7) (1959), 30–32.
|
|
|
|
|
|
|
|
|
Frank e Lazarus, 1960
[5][5] R.M. Frank & R.B. Lazarus. A high-speed sorting procedure. Communications of the ACM, 3(1) (1960), 20–22.
|
|
|
|
|
|
|
|
|
Hibbard, 1963
[8][8] T.N. Hibbard. An empirical study of minimal storage sorting. Communications of the ACM, 6(5) (1963), 206–213.
|
|
|
|
|
|
Papernov e Stasevich, 1965
[12][12] A.A. Papernov & G.V. Stasevich. A method of information sorting in computer memories. Problemy Peredachi Informatsii, 1(3) (1965), 81–98.
|
|
|
|
|
|
Pratt, 1972
[14][14] V.R. Pratt. “Shellsort and sorting networks”. Ph.D. thesis, Universidade de Stanford (1972).
|
|
|
|
|
|
Knuth, 1973
[10][10] D.E. Knuth. “The Art of Computer Programming 3: Sorting and Searching”. Addison-Wesley, EUA (1998).
|
|
|
|
|
|
Incerpi e Sedgewick, 1983
[9][9] J. Incerpi & R. Sedgewick. Improved upper bounds on Shellsort. In “Anais do 24º Annual Symposium on Foundations of Computer Science, 1983”. IEEE (1983), pp. 48–55.
|
|
|
|
|
|
Sedgewick, 1986
[15][15] R. Sedgewick. A new upper bound for ShellSort. Journal of Algorithms, 7(2) (1986), 159–173.
|
|
|
|
|
|
Gonnet e Baeza-Yates, 1991
[6][6] G.H. Gonnet & R.A. Baeza-Yates. “Handbook of Algorithms and Data Structures: in Pascal and C”. Addison-Wesley, EUA (1991).
|
em aberto |
|
|
|
, |
|
|
|
|
|
|
|
|
|
Tokuda, 1992
[19][19] N. Tokuda. An improved Shellsort. Anais do 12º IFIP World Computer Congress on Algorithms, Software, Architecture-Information Processing, 1 (1992), 449–457.
|
em aberto |
|
|
|
, |
|
|
|
Ciura, 2001
[2][2] M. Ciura. Best increments for the average case of shellsort. In “Fundamentals of Computation Theory”. Springer (2001), pp. 106–117.
|
em aberto |
|
|
|
|