An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String
نویسندگان
چکیده
An optimal O(loglogn) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become 0(fnl;gnl +loglogrl+p/n12p).
منابع مشابه
An Optimal O(log log n) Time Parallel String Matching Algorithm
An optimalO(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].
متن کاملOn the complexity of computing the order of repetition of a string
We show a simple O(n log n) time algorithm computing the order of repetition in a string. A parallel version of the algorithm works in O(log 2 n) time on n processors. The algorithm can be extended to report all squares and maximal repetitions in a string.
متن کاملConstant-Time Randomized Parallel String Matching
Given a pattern string of length m for the string matching problem, we design an algorithm that computes deterministic samples of a suuciently 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 ...
متن کاملOptimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
of results Optimal concurrent-read concurrent-write parallel algorithms for two problems are presented: Finding all the periods of a string. The period of a string can be computed by previous eecient parallel algorithms only if it is shorter than half of the length of the string. Our new algorithm computes all the periods in optimal O(loglog n) time, even if they are longer. The algorithm can b...
متن کاملOptimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a suu-ciently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 25 شماره
صفحات -
تاریخ انتشار 1996