Optimal packed string matching
From MaRDI portal
Publication:2911643
DOI10.4230/LIPICS.FSTTCS.2011.423zbMATH Open1246.68272OpenAlexW2242821730MaRDI QIDQ2911643FDOQ2911643
Authors: Oren Ben-Kiki, Philip Bille, Dany Breslauer, Roberto Grossi, Oren Weimann, Leszek Gąsieniec
Publication date: 31 August 2012
Full work available at URL: https://doi.org/10.4230/lipics.fsttcs.2011.423
Recommendations
Cited In (9)
- Fast Packed String Matching for Short Patterns
- Fast and flexible packed string matching
- Fast searching in packed strings
- Average optimal string matching in packed strings
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Towards optimal packed string matching
- Fast Searching in Packed Strings
- Constant-time word-size string matching
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
This page was built for publication: Optimal packed string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911643)