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].
منابع مشابه
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 ...
متن کامل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 ...
متن کاملFast Parallel String Pre x-Matching
An O(log log m) time n logm log logm-processor CRCW-PRAM algorithm for the string preex-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 m log logm processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the sa...
متن کاملWork - Time Optimal Parallel Pre x Matching
Consider the preex matching problem: Given a pattern P of length m and a text T of length n, nd for all positions i in T the longest preex of P starting at i. We present a parallel algorithm for the preex matching problem over general alphabets whose text search takes optimal O((m)) time and preprocessing takes optimal O(log log m) time, where (m) is the inverse Ackermann function. An (log log ...
متن کاملFast Parallel String Prefix-Matching
An O(log log m) time n log m log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over a general alphabet is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m loglog 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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 1990