Tight lower bounds for Shellsort
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 255-262
- https://doi.org/10.1007/3-540-19487-8_29
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A new upper bound for ShellsortJournal of Algorithms, 1986
- Improved upper bounds on shellsortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- 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