Faster Parallel String Matching via Larger Deterministic Samples

DOI10.1006/JAGM.1994.1014MaRDI QIDQ4285916zbMATH OpenOpenAlexFDO

Authors Tal Goldberg, Uri Zwick

Publication date 22 March 1994

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1994.1014

zbMATH Keywords

optimal speedup parallel string matching algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Constant-Time Randomized Parallel String Matching
• Constant-time word-size string matching
• Optimal parallel pattern matching in strings
• scientific article; zbMATH DE number 3911754
• A Lower Bound for Parallel String Matching

Cited in

(13)

• Derivation of a parallel string matching algorithm
• String search in coarse-grained parallel computers
• Towards optimal packed string matching
• Constant-time word-size string matching
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Parallel String Matching Algorithms
• A Lower Bound for Parallel String Matching
• scientific article; zbMATH DE number 176779 (Why is no real title available?)
• Efficient string matching on packed texts
• Optimal parallel algorithms for Prefix Matching
• Simple Optimal Parallel Multiple Pattern Matching
• String matching in O( n+ m) quantum time

This page was built for publication: Faster Parallel String Matching via Larger Deterministic Samples

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