On the lower bound for parallel string matching

DOI10.1080/00207169408804319zbMath0849.68054OpenAlexW4232352560MaRDI QIDQ4844575

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)

Related Items (1)

On the lower bound for parallel string matching

Cites Work

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

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