Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time (1998)

Cached

Download Links

by Rasmus Pagh
Venue:IN PROC. 26TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP
Citations:18 - 0 self

Documents Related by Co-Citation

192 Succinct indexable dictionaries with applications to encoding k-ary trees and multisets – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
194 High-order entropy-compressed text indexes – Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter - 2003
94 Compact pat trees – D Clark - 1996
172 Space-efficient static trees and graphs – G Jacobson - 1989
43 An alphabet-friendly FM-index – Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro - 2004
65 Indexing Text using the Ziv-Lempel Trie – Gonzalo Navarro - 2002
571 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
649 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
131 An Analysis of the Burrows-Wheeler Transform – Giovanni Manzini - 2001