The complexity of the co-occurrence problem

DOI10.1007/978-3-031-20643-6_4zbMath1525.68034arXiv2206.10383OpenAlexW4312888971MaRDI QIDQ6166971

Tord Stordalen, Inge Li Gørtz, Philip Bille

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

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

zbMATH Keywords

data structuresstringslower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Cites Work

• Universal classes of hash functions
• Log-logarithmic worst-case range queries are possible in space theta(N)
• AWLCO: All-Window Length Co-Occurrence
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of the co-occurrence problem