On the lower bound for parallel string matching

DOI10.1080/00207169608804533zbMATH Open0868.68064OpenAlexW2094293437MaRDI QIDQ4332447FDOQ4332447

Authors: Clive N. Galley, Costas S. Iliopoulos 

Publication date: 13 February 1997

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

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

Recommendations

• A Lower Bound for Parallel String Matching
• On the lower bound for parallel string matching
• On the Exact Complexity of String Matching: Lower Bounds

zbMATH Keywords

analysis of algorithmsparallel algorithmsdesign of algorithmsparallel string matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• A Lower Bound for Parallel String Matching
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings
• On the lower bound for parallel string matching

Cited In (3)

• Title not available (Why is that?)
• A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
• On the lower bound for parallel string matching

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 Q4332447)