Analysis of Shellsort and related algorithms (1996)

Cached

Download Links

by Robert Sedgewick
Venue:ESA ’96: Fourth Annual European Symposium on Algorithms
Citations:26 - 0 self

Active Bibliography

2 Routing and Sorting on Fixed Topologies – Torsten Suel - 1994
13 Lower Bounds for Shellsort – C. Greg Plaxton, Torsten Suel - 1997
12 Randomized Shellsort: A simple oblivious sorting algorithm – Michael T. Goodrich - 2010
5 The worst case in Shellsort and related algorithms – Bjorn Poonen - 1993
1 An -size fault-tolerant sorting network – Yuan Ma - 1996
1 Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons – Michael T. Goodrich
3 A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks – Greg Plaxton, Torsten Suel - 1994
1 Analysis of Sorting Algorithms by Kolmogorov Complexity -- A Survey – Paul Vitanyi - 2003
6 A Lower Bound for Sorting Networks Based on the Shuffle Permutation – C. Greg Plaxton, Torsten Suel - 1994
10 A Lower Bound on the Average-Case Complexity of Shellsort – Tao Jiang, Ming Li, Paul Vitanyi - 1999
6 P.: The average-case complexity of Shellsort – 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
21 An Experimental Analysis of Parallel Sorting Algorithms – G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, M. Zagha - 1998
14 Optimal Routing of Parentheses on the Hypercube – Ernst W. Mayr, Ralph Werchner - 1994
14 Hypercubic Sorting Networks – Tom Leighton, C. Greg Plaxton - 1998
7 Improved Routing and Sorting on Multibutterflies – B. M. Maggs, B. Vöcking - 2000
67 Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers – Robert Cypher, C. Greg Plaxton - 1996
3 Load Sharing with Parallel Priority Queues – Ian Parberry - 1991