The worst case in Shellsort and related algorithms (1993)

by Bjorn Poonen
Venue:Journal of Algorithms
Citations:5 - 0 self

Active Bibliography

26 Analysis of Shellsort and related algorithms – Robert Sedgewick - 1996
2 Routing and Sorting on Fixed Topologies – Torsten Suel - 1994
13 Lower Bounds for Shellsort – C. Greg Plaxton, Torsten Suel - 1997
1 Analysis of Sorting Algorithms by Kolmogorov Complexity -- A Survey – Paul Vitanyi - 2003
12 Randomized Shellsort: A simple oblivious sorting algorithm – Michael T. Goodrich - 2010
6 On the Performance of WEAK-HEAPSORT – Stefan Edelkamp, Ingo Wegener - 2000
6 P.: The average-case complexity of Shellsort – Tao Jiang, Ming Li, Paul Vitányi - 1999
10 A Lower Bound on the Average-Case Complexity of Shellsort – Tao Jiang, Ming Li, Paul Vitanyi - 1999
1 Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons – Michael T. Goodrich
A characterization of the Frobenius problem and its application to arithmetic progressions – Hans J. H. Tuenter - 2006
2 Frobenius Problem for Semigroups S (d1, d2, d3) – Leonid G. Fel - 2008
Best Increments for the Average Case of Shellsort – Marcin Ciura - 2001
3 A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks – Greg Plaxton, Torsten Suel - 1994
Average-Case Complexity of Shellsort (Preliminary Version) – Tao Jiang, Ming Li, Paul Vitányi - 1999
1 A New Computation Model for Rack-Based Computing – Foto N. Afrati, Jeffrey D. Ullman
A New Computation Model for Cluster Computing – Foto N. Afrati, Jeffrey D. Ullman - 2009
2 On the Number of Representations of an Integer by a Linear Form – Gil Alon, Pete L. Clark
7 Frobenius numbers by lattice point enumeration – David Einstein, Daniel Lichtblau, Adam Strzebonski
7 THE FROBENIUS PROBLEM IN A FREE MONOID – Jui-yi Kao, Jeffrey Shallit, Zhi Xu - 2008