A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Constant-Time Randomized Parallel String Matching
1997
SIAM journal on computing (Print)
Given a pattern string of length m for the string matching problem, we design an algorithm that computes deterministic samples of a su ciently long substring of the pattern in constant time. This problem used to be the bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The best previous time bound was O(log 2 m= log log m). We use this algorithm to obtain the following results. All algorithms below are optimal parallel algorithms on a CRCW PRAM. 1. A
doi:10.1137/s009753979528007x
fatcat:tlj6h2fsabb4vawaubk2p74zxy