Engineering a Sort Function (1993)

Cached

Download Links

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

Documents Related by Co-Citation

147 Fast Algorithms for Sorting and Searching Strings – Jon L. Bentley, Robert Sedgewick - 1997
565 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
644 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
8533 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest - 1989
17 Implementing Radixsort – Arne Andersson, Stefan Nilsson - 1998
162 Handbook of Algorithms and Data Structures – Gaston Gonnet - 1984
88 Implementing Quicksort Programs – R Sedgewick - 1978
14 Engineering Radix Sort – Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy - 1993
17 An efficient method for in memory construction of suffix arrays – H Itoh, H Tanaka - 1999
45 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 L.: Rapid identification of repeated patterns in strings, trees and arrays – R M Karp, R E Miller, A Rosenberg - 1972
54 Linear-time construction of suffix arrays – D K Kim, J S Sim, H Park, K Park - 2003
150 Simple linear work suffix array construction – Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt - 2003
63 Algorithm 64: Quicksort – C A R Hoare - 1961
117 Reducing the Space Requirement of Suffix Trees – Stefan Kurtz - 1999
13 Quicksort with equal keys – R Sedgewick - 1977