Optimal Packed String Matching

DOI10.4230/LIPIcs.FSTTCS.2011.423zbMath1246.68272OpenAlexW2242821730MaRDI QIDQ2911643

Roberto Grossi, Dany Breslauer, Oren Ben-Kiki, Oren Weimann, Philip Bille, Leszek Gąsieniec

Publication date: 31 August 2012

Full work available at URL: https://doi.org/10.4230/lipics.fsttcs.2011.423

zbMATH Keywords

string matchingreal timebit parallelismspace efficiency

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (4)

Fast and flexible packed string matching ⋮ Towards optimal packed string matching ⋮ Worst-case efficient single and multiple string matching on packed texts in the word-RAM model ⋮ Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

This page was built for publication: Optimal Packed String Matching