PARALLEL DETECTION OF ALL PALINDROMES IN A STRING

This paper presents two efficient concurrent-read concurrent-write par allel algorithms that find all palindromes in a given string: 1. An O( log n) time, n-processor algorithm over general alphabets. In the case of constant size alphabets the algorithm requires only n/log n proces sors, and thus achieves an optimal-speedup. 2. An O(log log n) time, n log n/loglog n-processor algorithm over general alphabets. This is th e fastest possible time with the number of processors used. These new results improve on the known parallel palindrome detection algorithms by using smaller auxiliary space and either by making fewer operations or by achieving a faster running time.