A lower bound on the average-case complexity of shellsort
Journal of the ACM (JACM)
Analyzing variants of Shellsort
Information Processing Letters
Asymptotic analysis of (3, 2, 1)-shell sort
Random Structures & Algorithms
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Using finite experiments to study asymptotic performance
Experimental algorithmics
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
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)
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Information Sciences: an International Journal
Parallel Shellsort Algorithm for Many-Core GPUs with CUDA
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |