An 0(1) time algorithm for string matching

DOI10.1080/00207169208804061zbMath0742.68023OpenAlexW2148751491MaRDI QIDQ3989790

Gen-Huey Chen

Publication date: 28 June 1992

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

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

zbMATH Keywords

string matchingprocessor arrayreconfigurable bus system

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

On the lower bound for parallel string matching

Cites Work

• Time-space-optimal string matching
• A fast string searching algorithm
• Fast Pattern Matching in Strings

This page was built for publication: An 0(1) time algorithm for string matching