Deterministic Sparse Suffix Sorting on Rewritable Texts

DOI10.1007/978-3-662-49529-2_36zbMath1475.68468arXiv1509.07417OpenAlexW2160247847MaRDI QIDQ2802962

Johannes Fischer, Dominik Köppl, Tomohiro I.

Publication date: 3 May 2016

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items

Tight lower bounds for the longest common extension problem, Practical Performance of Space Efficient Data Structures for Longest Common Extensions.