Engineering a Sort Function (1993)

Cached

Download Links

by Jon L. Bentley , M. Douglas Mcilroy
Citations:58 - 1 self

Documents Related by Co-Citation

148 Fast Algorithms for Sorting and Searching Strings – Jon L. Bentley, Robert Sedgewick - 1997
568 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
646 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
17 Implementing Radixsort – Arne Andersson, Stefan Nilsson - 1998
163 Handbook of algorithms and data structures – G H GONNET, R BAEZA-YATES - 1991
87 Implementing Quicksort Programs – R Sedgewick - 1978
15 Engineering Radix Sort – Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy - 1993
18 An efficient method for in memory construction of suffix arrays – H Itoh, H Tanaka - 1999
46 FASTER SUFFIX SORTING – N. Jesper Larsson, Kunihiko Sadakane - 1999
369 Time bounds for selection – Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert, E. Tarjan - 1973
30 A New Efficient Radix Sort – Arne Andersson , Stefan Nilsson - 1994
112 The influence of caches on the performance of sorting – Anthony LaMarca, Richard E. Ladner - 1997
71 Rapid identification of repeated patterns in strings, trees and arrays – R M Karp, R E Miller, A L Rosenberg - 1972
62 Algorithm 64: Quicksort – C A R Hoare - 1961
118 Reducing the Space Requirement of Suffix Trees – Stefan Kurtz - 1999
12 Quicksort with equal keys – R Sedgewick - 1977
8 A perspective on quicksort – J Ja’Ja’
7 A general contraction theorem and asymptotic normality in combinatorial structures – Ralph Neininger, Ludger Rüschendorf - 2001