Lower Bounds for Shellsort
From MaRDI portal
Publication:4339002
Recommendations
Cited in
(9)- On shellsort and the Frobenius problem
- Analyzing variants of Shellsort
- On the average-case complexity of Shellsort
- scientific article; zbMATH DE number 4126701 (Why is no real title available?)
- Tight lower bounds for Shellsort
- A Lower Bound on the Size of Shellsort Sorting Networks
- The Worst Case in Shellsort and Related Algorithms
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Improved upper bounds on Shellsort
This page was built for publication: Lower Bounds for Shellsort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339002)