On the lower bound for parallel string matching

DOI10.1080/00207169408804319MaRDI QIDQ4844575zbMATH OpenOpenAlexFDO

Authors Clive N. Galley

Publication date 4 November 1996

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169408804319

zbMATH Keywords

analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• On the lower bound for parallel string matching
• A Lower Bound for Parallel String Matching
• scientific article; zbMATH DE number 710402
• A constant-time optimal parallel string-matching algorithm
• Optimal parallel algorithms for string matching
• On the Exact Complexity of String Matching: Lower Bounds
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Constant-Time Randomized Parallel String Matching
• A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
• Tighter Lower Bounds on the Exact Complexity of String Matching

Cites work

• A Lower Bound for Parallel String Matching
• An 0(1) time algorithm for string matching
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

Cited in

(6)

• Bit-parallel witnesses and their applications to approximate string matching
• A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
• A Lower Bound for Parallel String Matching
• scientific article; zbMATH DE number 1263250 (Why is no real title available?)
• On the lower bound for parallel string matching
• Tight comparison bounds for the string prefix-matching problem

This page was built for publication: On the lower bound for parallel string matching

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