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

Documents Related by Co-Citation

31 A high-speed sorting procedure – D L Shell
20 Shellsort and Sorting Networks – V R Pratt - 1972
9 Shellsort with three increments, Random Struct – S Janson, D E Knuth
13 Lower Bounds for Shellsort – C. Greg Plaxton, Torsten Suel - 1997
17 Improved upper bounds on Shellsort – J Incerpi, R Sedgewick
14 New applications of the incompressibility method – H Buhrman, T Jiang, M Li, P M B Vitányi - 1999
6 Open problems in the analysis of sorting and searching algorithms, Presented at Workshop on Prob. Analysis of Algorithms – R Sedgewick - 1997
6 A method for information sorting in computer memories, Problems Inform – A Papernov, G Stasevich
1683 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
522 Three approaches to the quantitative definition of information – K Kolmogorov
359 The Art of Computer Programming, Vol. 3: Sorting and Searching – D E Knuth - 1973
6 P.: The average-case complexity of Shellsort – Tao Jiang, Ming Li, Paul Vitányi - 1999
12 A fast, easy sort – S Lacey, R Box - 1991
9 An analysis of (h, k, 1)-Shellsort – A C C Yao
501 Sorting networks and their applications – K. E. Batcher - 1968
17 Sorting on electronic computer systems – E H Friend - 1956
23 Sorting using networks of queues and stacks – R E Tarjan - 1972
41 The ergodic theory of subadditive stochastic processes – J F C Kingman - 1968
127 L.A.Shepp, A variational problem for random Young tableaux – B F Logan - 1977