论文信息 - Optimal Parallel Algorithms for Periods, Palindromes and Squares (Preliminary Version) - 字舞流文

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Preliminary Version)

Zvi Galil | Alberto Apostolico | Dany Breslauer

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

[2] Wojciech Rytter,et al. Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays , 1991, Theor. Comput. Sci..

[3] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[4] Maxime Crochemore,et al. An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[5] Maxime Crochemore,et al. Transducers and Repetitions , 1986, Theor. Comput. Sci..

[6] Uzi Vishkin,et al. Optimal Parallel Pattern Matching in Strings , 2017, Inf. Control..

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

[8] Franco P. Preparata,et al. Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

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

[10] Wojciech Rytter,et al. Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings , 1991, Inf. Process. Lett..

[11] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[12] Richard J. Lorentz,et al. Linear Time Recognition of Squarefree Strings , 1985 .

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