A linear lower bound on index size for text retrieval
From MaRDI portal
Publication:4458870
DOI10.1016/S0196-6774(03)00043-9zbMath1079.68029MaRDI QIDQ4458870
Erik D. Demaine, Alejandro López-Ortiz
Publication date: 14 March 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00043-9
68P20: Information storage and retrieval of data
Related Items
Counting suffix arrays and strings, The function-inversion problem: barriers and opportunities, Succinct indices for path minimum, with applications, The cell probe complexity of succinct data structures, Random Access to High-Order Entropy Compressed Text, Orthogonal Range Searching for Text Indexing, A Survey of Data Structures in the Bitprobe Model, Fast String Dictionary Lookup with One Error