HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Parallel detection of all palindromes in a string

Abstract : This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all palindromes in a given string : - an 0/log n) time, n-processor algorithm over general alphabets. In case of constant size alphabets the algorithm requires only n/log n processors and thus achieves an optimal-speedup - An 0(log log n) time, n log n/log log n-processor algorithm over general alphabets. This is the 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:42:24 PM
Last modification on : Friday, February 4, 2022 - 3:16:46 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 3:53:18 PM


  • HAL Id : inria-00074536, version 1



A. Apopstolico, Dany Breslauer, Z. Galil. Parallel detection of all palindromes in a string. [Research Report] RR-2136, INRIA. 1993. ⟨inria-00074536⟩



Record views


Files downloads