Skip to main content
Journal ArticleOPEN ACCESS

A Constant-Time Optimal Parallel String-Matching Algorithm

Journal of the ACM (JACM) (1995) 42(4) 908-918
DOI: 10.1145/210332.210341
20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Given a pattern string, we describe a way to preprocess it. We design a CRCW-PRAM constant-time optimal parallel algorithm for fmdmg all occurrences of the (preprocessed) pattern in any given text. © 1995, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Galil, Z. (1995). A Constant-Time Optimal Parallel String-Matching Algorithm. Journal of the ACM (JACM), 42(4), 908–918. https://doi.org/10.1145/210332.210341

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free