Fast Parallel String Prefix-Matching

An O(log log m) time n log mlog log m-processor CRCW-PRAM algorithm for the string prefix-matching problem over general alphabets is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log mlog log m processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the same number of operations.

[1]  Zvi Galil,et al.  Optimal parallel algorithms for string matching , 1984, STOC '84.

[2]  Dany Breslauer,et al.  Efficient string algorithmics , 1992 .

[3]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[4]  Gary Benson,et al.  An Alphabet Independent Approach to Two-Dimensional Pattern Matching , 1994, SIAM J. Comput..

[5]  Alberto Apostolico,et al.  An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String , 1996, SIAM J. Comput..

[6]  Zvi Galil,et al.  Parallel Detection of all Palindromes in a String , 1994, STACS.

[7]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[8]  Zvi Galil,et al.  A lower bound for parallel string matching , 1991, STOC '91.

[9]  Zvi Galil,et al.  An Optimal O(log log n) Time Parallel String Matching Algorithm , 1990, SIAM J. Comput..

[10]  Wojciech Rytter,et al.  Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[12]  Michael G. Main,et al.  An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[13]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[14]  Zvi Galil,et al.  Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract) , 1992, ICALP.

[15]  Faith Ellen,et al.  Relations between concurrent-write models of parallel computation , 1984, PODC '84.

[16]  Zvi Galil,et al.  Truly alphabet-independent two-dimensional pattern matching , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Dany Breslauer,et al.  Testing String Superprimitivity in Parallel , 1994, Inf. Process. Lett..