Near-optimal search time in \(\delta \)-optimal space

DOI10.1007/978-3-031-20624-5_6arXiv2206.00781OpenAlexW4312934643MaRDI QIDQ6163966

Tomasz Kociumaka, Francisco Olivares, Gonzalo Navarro

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.00781

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Near-optimal search time in \(\delta \)-optimal space, and vice versa

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
• Towards a definitive measure of repetitiveness
• Sublinear algorithms for approximating string compressibility
• Grammar-compressed indexes with logarithmic search time
• On the Complexity of Finite Sequences
• Optimal-Time Dictionary-Compressed Indexes
• Locally Consistent Parsing for Text Indexing in Small Space
• At the roots of dictionary compression: string attractors
• Developments in Language Theory

This page was built for publication: Near-optimal search time in \(\delta \)-optimal space