A lower bound on the average-case complexity of shellsort

Journal of the ACM

Volumn 47, Issue 5, 2000, Pages 905-911

  Jiang, Tao ^a,b,c,d,e   Ming, L I ^a   Vitányi, Paul ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CWI   (Netherlands)

^d University of California Riverside   (United States)

^e University of California   (United States)

Author keywords

Average case complexity; Computational complexity; Kolmogorov complexity; Shellsort; Sorting

Indexed keywords

AVERAGE-CASE COMPLEXITY; KOLMOGOROV COMPLEXITY; SEARCHING; SHELLSORTING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; INFORMATION THEORY; LEARNING SYSTEMS; PROBLEM SOLVING; SORTING;

COMPUTATIONAL COMPLEXITY;

EID: 0004244648     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355483.355488     Document Type: Article

References (13)

1. INCERPI, J., AND SEDGEWICK, R. 1985. Improved upper bounds on Shellsort. J. Comput. Syst. Sei. 31, 210-224.
2. JANSON, S., AND KNUTH, D. E. 1997. Shellsort with three increments. Random Struct. Alg., 10, 125-142.
3. JIANG, T., Li, M., AND VITâNYI, P. 1999. The average-case complexity of Shellsort. In Proceedings ofICALP'99. Lecture Notes in Computer Science, vol. 1644. Springer-Verlag, Berlin, pp. 453-462.
4. KNUTH, D. E. 1998. The Art of Computer Programming Vol. 3: Sorting and Searching. 2nd ed. Addison-Wesley, Reading, Mass.
5. KOLMOGOROV, A. N. 1965. Three approaches to the quantitative definition of information. Probl. Inform. Trans, l, 1-7.
6. Li, M., AND VITâNYI, P. M. B. 1997. An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed. Springer-Verlag, New York.
7. PAPERNOV, A., AND STASEVICH, G. 1965. A method for information sorting in computer memories, Problems Inform. Transmission, 1:3, 63-75.
8. PLAXTON, C. G., POONEN, B., AND SUEL, T. 1992. Improved lower bounds for Shellsort. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., pp. 226-235.
9. PRATT, V. R. 1972. Shellsort and Sorting Netivorks. Ph.D. dissertation. Stanford University, Stanford, Calif.
10. SEDGEWICK, R. 1996. Analysis of Shellsort and related algorithms. In Proceedings of the 4th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1136. SpringerVerlag, Berlin, Germany, pp. 1-11.
11. SEDGEWICK, R. 1997. Open problems in the analysis of sorting and searching algorithms. In Proceedings of the Workshop on Probability Analysis of Algorithms (Princeton, N.J.). http://www.cs.princeton/∼rs.
12. SHELL, D. L. 1959. A high-speed sorting procedure. Commun. ACM 2, 7 (July), 30-32.
13. YAO, A. C. C. 1980. An analysis of (h, k, l)-Shellsort, J. Algorithms 1, 14-50.