Optimal parallel pattern matching in strings

Abstract

Given a text of length n and a pattern of length m, we present a parallel linear algorithm for finding all occurrences of the pattern in the text. The algorithm runs in O(n/p) time using any number of p ⩽ n/log m processors on a concurrent-read concurrent-write parallel random-access-machine.