Improved Lower Bounds for Shellsort (1992)

by C. Greg Plaxton , Bjorn Poonen , Torsten Suel
Venue:In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science
Citations:13 - 4 self

Documents Related by Co-Citation

20 Shellsort and Sorting Networks – V R Pratt - 1972
17 Improved upper bounds on Shellsort – J Incerpi, R Sedgewick
31 A high-speed sorting procedure – D L Shell
26 Analysis of Shellsort and related algorithms – Robert Sedgewick - 1996
111 Sorting in c log n parallel steps – M Ajtai, J Komlós, E Szemerédi - 1983
6 Open problems in the analysis of sorting and searching algorithms, Presented at Workshop on Prob. Analysis of Algorithms – R Sedgewick - 1997
1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
532 Three approaches to the quantitative definition of information – A N Kolmogorov - 1965
14 New applications of the incompressibility method – H Buhrman, T Jiang, M Li, P Vitányi - 1999
9 Shellsort with three increments, Random Struct – S Janson, D E Knuth
10 A lower bound on the size of Shellsort sorting networks – R E Cypher - 1993
9 An analysis of (h, k, 1)-Shellsort – A C C Yao
501 Sorting networks and their applications – K. E. Batcher - 1968
1309 Introduction to Parallel Algorithms and Architectures: Arrays – F T Leighton - 1991
34 Improved Sorting Networks with O(log n) Depth, Algorithmica – M S Paterson - 1990
358 The Art of Computer Programming, Vol.3: Sorting and Searching – D E Knuth - 1973
6 A method for information sorting in computer memories, Problems Inform – A Papernov, G Stasevich
2190 The Art of Computer Programming – Donald Knuth - 1973
10 A Lower Bound on the Average-Case Complexity of Shellsort – Tao Jiang, Ming Li, Paul Vitanyi - 1999