A constant-time optimal parallel string-matching algorithm

DOI10.1145/210332.210341MaRDI QIDQ4369885zbMATH OpenOpenAlexFDO

Authors Zvi Galil

Publication date 28 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/210332.210341

zbMATH Keywords

string matchingpattern stringoptimal parallel algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Constant-Time Randomized Parallel String Matching
• Optimal parallel algorithms for string matching
• scientific article; zbMATH DE number 3911754
• Optimal parallel pattern matching in strings
• scientific article; zbMATH DE number 710402
• scientific article; zbMATH DE number 2247683
• Parallel String Matching Algorithms
• scientific article; zbMATH DE number 826050

Cited in

(14)

• A parallel multistart algorithm for the closest string problem
• Optimal parallel detection of squares in strings
• Parallel String Matching
• Constant-Time Randomized Parallel String Matching
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• scientific article; zbMATH DE number 1263250 (Why is no real title available?)
• Towards optimal packed string matching
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Optimal parallel pattern matching in strings
• A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
• On the lower bound for parallel string matching
• Efficient CRCW-PRAM algorithms for universal substring searching
• scientific article; zbMATH DE number 3911754 (Why is no real title available?)
• Optimal parallel string matching algorithm on body centered hypercube

This page was built for publication: A constant-time optimal parallel string-matching algorithm

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