scientific article; zbMATH DE number 7378722
From MaRDI portal
Publication:5009616
DOI10.4230/LIPIcs.ESA.2018.52MaRDI QIDQ5009616
Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.01695
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Sensitivity of string compressors and repetitiveness measures, A combinatorial view on string attractors
Cites Work
- Unnamed Item
- Wavelet trees for all
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Indexing compressed text
- Data compression via textual substitution
- Grammar-based codes: a new class of universal lossless source codes
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Complete inverted files for efficient text retrieval and analysis
- At the roots of dictionary compression: string attractors
- Linear time construction of compressed text indices in compact space
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
