Near-optimal search time in \(\delta \)-optimal space, and vice versa
From MaRDI portal
Publication:6130318
DOI10.1007/s00453-023-01186-0OpenAlexW4388414939MaRDI QIDQ6130318
Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
Publication date: 2 April 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01186-0
Cites Work
- On compressing and indexing repetitive sequences
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- A \textit{really} simple approximation of smallest grammar
- Sublinear algorithms for approximating string compressibility
- Grammar-compressed indexes with logarithmic search time
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Efficient randomized pattern-matching algorithms
- On the Complexity of Finite Sequences
- Alphabet-Independent Compressed Text Indexing
- Optimal-Time Dictionary-Compressed Indexes
- Locally Consistent Parsing for Text Indexing in Small Space
- At the roots of dictionary compression: string attractors
- Uniqueness Theorems for Periodic Functions
- Orthogonal range searching on the RAM, revisited
- Developments in Language Theory
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- Near-optimal search time in \(\delta \)-optimal space
This page was built for publication: Near-optimal search time in \(\delta \)-optimal space, and vice versa
