Tight lower bounds for Shellsort
- 30 June 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (2) , 242-251
- https://doi.org/10.1016/0196-6774(90)90005-y
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- More on shellsort increment sequencesInformation Processing Letters, 1990
- On Shellsort and the frobenius problemBIT Numerical Mathematics, 1989
- A new upper bound for ShellsortJournal of Algorithms, 1986
- Improved upper bounds on shellsortJournal of Computer and System Sciences, 1985
- On the linear diophantine problem of Frobenius.Journal für die reine und angewandte Mathematik (Crelles Journal), 1977
- Representations of integers by linear forms in nonnegative integersJournal of Number Theory, 1972
- An empirical study of minimal storage sortingCommunications of the ACM, 1963
- A Linear Diophantine ProblemCanadian Journal of Mathematics, 1960
- A high-speed sorting procedureCommunications of the ACM, 1959
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942