Shellsort

Known as: Shell Sort, Shell, Shell's methodÂ
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting byâ€¦Â (More)
Wikipedia

1970-2017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this article, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version ofâ€¦Â (More)
Is this relevant?
2010
2010
In this paper, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version ofâ€¦Â (More)
Is this relevant?
2000
2000
• J. ACM
• 2000
We demonstrate an Î©(<italic>pn</italic><supscrpt>1+1/<italic>p </italic>) lower bound on the average-case running time (uniformâ€¦Â (More)
Is this relevant?
1999
1999
• ICALP
• 1999
We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisonsâ€¦Â (More)
Is this relevant?
1999
1999
• Computers and Their Applications
• 1999
The recent popularity of genetic algorithms (GA's) and their application to a wide variety of problems is a result of their easeâ€¦Â (More)
Is this relevant?
1997
1997
• Random Struct. Algorithms
• 1997
A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with incrementsâ€¦Â (More)
Is this relevant?
1997
1997
• J. Algorithms
• 1997
We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an (n lg 2 n=(lgâ€¦Â (More)
Is this relevant?
1996
1996
We consider the worst-case running time of Shellsort when only a constant number,c, of increments are allowed. Forc=3, we showâ€¦Â (More)
Is this relevant?
1992
1992
• FOCS
• 1992
We give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are bothâ€¦Â (More)
Is this relevant?
1983
1983
• 24th Annual Symposium on Foundations of Computerâ€¦
• 1983
The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be Î˜(N3/2), due toâ€¦Â (More)
Is this relevant?