Engineering Radix Sort (1993)

Cached

Download Links

by Peter M. McIlroy , Keith Bostic , M. Douglas McIlroy
Venue:COMPUTING SYSTEMS
Citations:14 - 0 self

Documents Related by Co-Citation

147 Fast Algorithms for Sorting and Searching Strings – Jon L. Bentley, Robert Sedgewick - 1997
58 Engineering a Sort Function – Jon L. Bentley, M. Douglas Mcilroy - 1993
12 Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries – Ranjan Sinha, Justin Zobel
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
15 Radix Sorting & Searching – S Nilsson - 1996
25 Fast lightweight suffix array construction and checking – Stefan Burkhardt, Juha Kärkkäinen - 2003
566 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
72 Space efficient linear time construction of suffix arrays – Pang Ko, Srinivas Aluru - 2003
150 Simple linear work suffix array construction – Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt - 2003
646 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
188 Compressed suffix arrays and suffix trees with applications to text indexing and string matching – Roberto Grossi, Jeffrey Scott Vitter - 2005
71 L.: Rapid identification of repeated patterns in strings, trees and arrays – R M Karp, R E Miller, A Rosenberg - 1972
30 A New Efficient Radix Sort – Arne Andersson , Stefan Nilsson - 1994
618 Text Compression – Timothy C Bell, John G Cleary, Ian H Witten - 1990
62 Results and Challenges in Web Search Evaluation – David Hawking, Nick Craswell, Paul Thistlewaite, Donna Harman - 1999
130 Overview of the second text retrieval conference – D Harman - 1995
28 Burst Tries: A Fast, Efficient Data Structure for String Keys – Steffen Heinz, Justin Zobel, Hugh E. Williams - 2002
18 Implementing Radixsort – Arne Andersson, Stefan Nilsson - 1998