A linear lower bound on index size for text retrieval
- 1 August 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 48 (1) , 2-15
- https://doi.org/10.1016/s0196-6774(03)00043-9
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Low Redundancy in Static Dictionaries with Constant Query TimeSIAM Journal on Computing, 2001
- From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree ConstructionAlgorithmica, 1997
- On-line construction of suffix treesAlgorithmica, 1995
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Should Tables Be Sorted?Journal of the ACM, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976