Skip to main content
Conference ProceedingsOPEN ACCESS

A constant-time optimal parallel string-matching algorithm

Proceedings of the Annual ACM Symposium on Theory of Computing (1992) Part F129722 69-76
DOI: 10.1145/129712.129720
16Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Given a pattern string, we describe a way to preprocess it. We design a constant-time optimal parallel algorithm for finding all occurrences of the (prepro-cessed) pattern in any given text.

Cite

CITATION STYLE

APA

Galil, Z. (1992). A constant-time optimal parallel string-matching algorithm. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129722, pp. 69–76). Association for Computing Machinery. https://doi.org/10.1145/129712.129720

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