Improved upper bounds on Shellsort
Journal of Computer and System Sciences
A new upper bound for Shellsort
Journal of Algorithms
Shellsort with three increments
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An empirical study of minimal storage sorting
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
Data organization and visualization using self-sorting map
Proceedings of Graphics Interface 2011
Parallel Shellsort Algorithm for Many-Core GPUs with CUDA
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousand elements. The obtained sequences outperform by about 3% the best ones known so far, and there is a plausible evidence that they are the optimal ones.