An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String (1995)

Cached

Download Links

by Alberto Apostolico , Dany Breslauer
Citations:11 - 6 self

Documents Related by Co-Citation

25 A Lower Bound for Parallel String Matching – Dany Breslauer - 1993
46 Relations between Concurrent-write Models of Parallel Computation – F E Fich, R L Ragde, A Wigderson
32 Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract) – Alberto Apostolico, Dany Breslauer, Zvi Galil - 1992
239 The parallel evaluation of general arithmetic expressions – Richard P. Brent - 1974
27 An optimal O(log log n) time parallel string matching algorithm – Dany Breslauer, Zvi Galil - 1990
15 Finding All Periods and Initial Palindromes of a String in Parallel – Dany Breslauer, Zvi Galil - 1991
70 An O(n log n) algorithm for finding all repetitions in a string – M G Main, R J Lorentz - 1984
629 Fast pattern matching in strings – D E Knuth, J Morris, V R Pratt - 1977
105 The equation a M = b N c P in a free group – R Lyndon, M-P Sch├╝tzenberger - 1962
8 Efficient String Algorithmics – Dany Breslauer - 1992
18 An On-Line String Superprimitivity Test – Dany Breslauer - 1992
10 Optimal parallel pattern matching – U Vishkin - 1985
75 Finding the maximum, merging, and sorting in a parallel computation model – Y Shiloach, U Vishkin - 1981
39 Optimal parallel algorithms for string matching – Z Galil - 1985
114 String matching and other products – M Fischer, M Paterson - 1974
18 Usefulness of the Karp-Miller-Rosenberg Algorithm – M Crochemore, W Rytter - 1989
6 Parallel Detection of all Palindromes in a String – Alberto Apostolico, Dany Breslauer, Zvi Galil - 1994
38 Truly Alphabet-Independent Two-Dimensional Pattern Matching – Z Galil, K Park - 1992
19 Optimally Fast Parallel Algorithms for Preprocessing and Pattern Matching in One and Two Dimensions – Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter - 1993