Average-case complexity of shellsort (preliminary version)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 453-462

  Jiang, Tao ^a   Li, Ming ^b   Vitányi, Paul ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

AVERAGE CASE; AVERAGE NUMBERS; AVERAGE-CASE COMPLEXITY; KOLMOGOROV COMPLEXITY; LOWER BOUNDS; PROOF METHODS; SORTING ALGORITHM;

AUTOMATA THEORY;

EID: 84887459471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_42     Document Type: Conference Paper

References (17)

1. H. Buhrman, T. Jiang, M. Li, and P. Vitányi, New applications of the incompressibility method, in the Proceedings of ICALP'99.
2. J. Incerpi and R. Sedgewick, Improved upper bounds on Shellsort, Journal of Computer and System Sciences, 31(1985), 210{224.
3. S. Janson and D.E. Knuth, Shellsort with three increments, Random Struct. Alg., 10(1997), 125-142.
4. S.V. Kerov and A.M. Versik, Asymptotics of the Plancherel measure on symmetric group and the limiting form of the Young tableaux, Soviet Math. Dokl. 18 (1977), 527-531.
5. J.F.C. Kingman, The ergodic theory of subadditive stochastic processes, Ann. Probab. 1 (1973), 883-909.
6. A.N. Kolmogorov, Three approaches to the quantitative definition of information. Problems Inform. Transmission, 1:1(1965), 1{7.
7. D.E. Knuth, The Art of Computer Programming, Vol.3: Sorting and Searching, Addison-Wesley, 1973 (1st Edition), 1998 (2nd Edition).
8. M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 2nd Edition, 1997.
9. B.F. Logan and L.A. Shepp, A variational problem for random Young tableaux, Advances in Math. 26 (1977), 206-222.
10. A. Papernov and G. Stasevich, A method for information sorting in computer memories, Problems Inform. Transmission, 1:3(1965), 63{75.
11. C.G. Plaxton, B. Poonen and T. Suel, Improved lower bounds for Shellsort, Proc. 33rd IEEE Symp. Foundat. Comput. Sci., pp. 226{235, 1992.
12. V.R. Pratt, Shellsort and Sorting Networks, Ph.D. Thesis, Stanford Univ., 1972.
13. R. Sedgewick, Analysis of Shellsort and related algorithms, presented at the Fourth Annual European Symposium on Algorithms, Barcelona, September, 1996.
14. R. Sedgewick, Open problems in the analysis of sorting and searching algorithms, Presented at Workshop on Prob. Analysis of Algorithms, Princeton, 1997.
15. D.L. Shell, A high-speed sorting procedure, Commun. ACM, 2:7(1959), 30{32.
16. R.E. Tarjan, Sorting using networks of queues and stacks, Journal of the ACM, 19(1972), 341{346.
17. A.C.C. Yao, An analysis of (h; k; 1)-Shellsort, J. of Algorithms, 1(1980), 14{50.