Constant-time word-size string matching

DOI10.1007/978-3-642-31265-6_7MaRDI QIDQ2904481zbMATH OpenOpenAlexFDO

Authors Dany Breslauer, Roberto Grossi, Leszek Gąsieniec

Publication date 14 August 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_7

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Constant-Time Randomized Parallel String Matching
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Faster Parallel String Matching via Larger Deterministic Samples
• Optimal packed string matching
• scientific article; zbMATH DE number 4090814

Cited in

(6)

• Constant-space string-matching in sublinear average time
• Towards optimal packed string matching
• Approximate pattern matching with \(k\)-mismatches in packed text
• scientific article; zbMATH DE number 4090814 (Why is no real title available?)
• Faster Parallel String Matching via Larger Deterministic Samples
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model

This page was built for publication: Constant-time word-size string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904481)