On the Weak Prefix-Search Problem

DOI10.1007/978-3-642-21458-5_23zbMath1339.68330OpenAlexW2179367625MaRDI QIDQ3011860

Paolo Ferragina

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_23

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case optimal tree layout in external memory
• The string B-tree
• Cache-Oblivious Algorithms
• Cache-oblivious string dictionaries
• Fast Prefix Search in Little Space, with Applications
• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

This page was built for publication: On the Weak Prefix-Search Problem