Parallel detection of all palindromes in a string - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Parallel detection of all palindromes in a string

A. Apopstolico
  • Function : Author
Z. Galil
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2136.pdf (466.98 Ko) Télécharger le fichier

Dates and versions

inria-00074536 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074536 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More