A parallel string search algorithm
Yoshiyasu Takefuji, Tetsuya S. Tanaka, K.C. Lee · IEEE Transactions on Systems Man and Cybernetics · 1992
A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m*n) processors where n is the length of a text and m is the length of a pattern. It requires two and only two iteration steps to find the pattern in the text, while the best existing parallel algorithm needs the computation time O(loglog n).>