|
19
|
Shellsort and Sorting Networks
– V R Pratt
- 1972
|
|
29
|
A high-speed sorting procedure
– D L Shell
|
|
16
|
Improved upper bounds on Shellsort
– J Incerpi, R Sedgewick
|
|
104
|
Sorting in c log n parallel steps
– M Ajtai, J Komlós, E Szemerédi
- 1983
|
|
23
|
Analysis of Shellsort and related algorithms
– Robert Sedgewick
- 1996
|
|
9
|
1980]. \An Analysis of (h; k; 1) Shellsort
– A C-C Yao
- 1980
|
|
9
|
A lower bound on the size of Shellsort sorting networks
– R Cypher
- 1993
|
|
430
|
Sorting networks and their applications
– K. E. Batcher
- 1968
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– F T Leighton
- 1992
|
|
31
|
Improved sorting networks with O(log N) depth
– M Paterson
- 1990
|
|
5
|
Open problems in the analysis of sorting and searching algorithms, Presented at Workshop on Prob. Analysis of Algorithms
– R Sedgewick
- 1997
|
|
7
|
Shellsort with three increments, Random Struct
– S Janson, D E Knuth
|
|
397
|
Three approaches to the quantitative definition of information
– A N Kolmogorov
- 1965
|
|
12
|
New applications of the incompressibility method
– H Buhrman, T Jiang, M Li, P Vitányi
- 1999
|
|
1412
|
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
– Ming Li, Paul Vitanyi
- 1997
|
|
1813
|
The Art Of Computer Programming
– D Knuth
- 1973
|
|
10
|
A Lower Bound on the Average-Case Complexity of Shellsort
– Tao Jiang, Ming Li, Paul Vitanyi
- 1999
|
|
25
|
Theoretical aspects of VLSI pin limitations
– R E Cypher
- 1993
|
|
12
|
Hypercubic Sorting Networks
– Tom Leighton, C. Greg Plaxton
- 1998
|
