Improved upper bounds on Shellsort
Journal of Computer and System Sciences
Shellsort with three increments
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A high-speed sorting procedure
Communications of the ACM
Analysis of Shellsort and Related Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Shellsort and sorting networks
Shellsort and sorting networks
Analyzing variants of Shellsort
Information Processing Letters
The average-case area of Heilbronn-type triangles
Random Structures & Algorithms
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
Information Processing Letters
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
| Hi-index | 0.01 |
We demonstrate an &Ohgr;(pn1+1/p ) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort.