The following pages link to A new upper bound for Shellsort (Q3742727):
Displaying 14 items.
- Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
- More on shellsort increment sequences (Q915466) (← links)
- Improved upper bounds on Shellsort (Q1069307) (← links)
- Bad cases for shaker-sort (Q1114410) (← links)
- Lattice translates of a polytope and the Frobenius problem (Q1196686) (← links)
- An improved shellsort algorithm (Q1389663) (← links)
- Shellsort with a constant number of increments (Q1816996) (← links)
- On shellsort and the Frobenius problem (Q1825677) (← links)
- Shellsort with three increments (Q3122909) (← links)
- The Worst Case in Shellsort and Related Algorithms (Q3141524) (← links)
- Asymptotic analysis of (3, 2, 1)-shell sort (Q3150199) (← links)
- The Frobenius Problem and Its Generalizations (Q3533000) (← links)
- On the average‐case complexity of Shellsort (Q4564861) (← links)
- Stochastic analysis of Shell Sort (Q5953110) (← links)