|
2
|
Routing and Sorting on Fixed Topologies
– Torsten Suel
- 1994
|
|
12
|
Lower Bounds for Shellsort
– C. Greg Plaxton, Torsten Suel
- 1997
|
|
4
|
Randomized Shellsort: A simple oblivious sorting algorithm
– Michael T. Goodrich
- 2010
|
|
4
|
The worst case in Shellsort and related algorithms
– Bjorn Poonen
- 1993
|
|
1
|
An -size fault-tolerant sorting network
– Yuan Ma
- 1996
|
|
|
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
|
|
5
|
Average-Case Complexity of Shellsort
– Tao Jiang, Ming Li, Paul Vitanyi
- 1999
|
|
10
|
A Lower Bound on the Average-Case Complexity of Shellsort
– Tao Jiang, Ming Li, Paul Vitanyi
- 1999
|
|
|
A New Computation Model for Cluster Computing
– Foto N. Afrati, Jeffrey D. Ullman
- 2009
|
|
1
|
A New Computation Model for Rack-Based Computing
– Foto N. Afrati, Jeffrey D. Ullman
|
|
17
|
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
|
|
12
|
Hypercubic Sorting Networks
– Tom Leighton, C. Greg Plaxton
- 1998
|
|
7
|
Improved Routing and Sorting on Multibutterflies
– B. M. Maggs, B. Vöcking
- 2000
|
|
1
|
Load Sharing with Parallel Priority Queues
– Ian Parberry
- 1991
|
|
67
|
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers
– Robert Cypher, C. Greg Plaxton
- 1996
|
