|
131
|
Fast Algorithms for Sorting and Searching Strings
– Jon L. Bentley, Robert Sedgewick
- 1997
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
461
|
A block-sorting lossless data compression algorithm
– M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler
- 1994
|
|
560
|
G: Suffix arrays: a new method for on-line string searches
– U Manber, Myers
- 1993
|
|
15
|
Implementing Radixsort
– Arne Andersson, Stefan Nilsson
- 1998
|
|
156
|
Handbook of Algorithms and Data Structures
– G H AND BAEZA-YATES GONNET, R
- 1991
|
|
81
|
Implementing quicksort Programs
– R Sedgewick
- 1978
|
|
13
|
Engineering Radix Sort
– Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy
- 1993
|
|
16
|
An efficient method for in memory construction of suffix arrays
– H AND TANAKA ITOH, H
- 1999
|
|
42
|
FASTER SUFFIX SORTING
– N. Jesper Larsson, Kunihiko Sadakane
- 1999
|
|
325
|
Expected time bounds for selection
– R W Floyd, R L Rivest
- 1975
|
|
29
|
A New Efficient Radix Sort
– Arne Andersson , Stefan Nilsson
- 1994
|
|
104
|
The influence of caches on the performance of sorting
– Anthony LaMarca, Richard E. Ladner
- 1997
|
|
64
|
Rapid identification of repeated patterns in strings, trees and arrays
– Richard M Karp, Raymond E Miller, Arnold L Rosenberg
- 1972
|
|
49
|
Algorithm 64: Quicksort
– C A R Hoare
- 1961
|
|
109
|
Reducing the Space Requirement of Suffix Trees
– Stefan Kurtz
- 1999
|
|
11
|
1977a]. \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
|
