Optimal Parallel Two Dimensional Text Searching on a CREW PRAM

Amihood Amir, Gary Benson, Martin Farach-Colton

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

We present a parallel algorithm for two dimensional text searching over a general alphabet. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(log m) on a CREW PRAM (where m is the length of the longest dimension of the pattern), thus matching the lower bound for string matching on a PRAM without concurrent writes. On a CRCW, the algorithm runs in time O(log log m).

Original languageEnglish
Pages (from-to)1-17
Number of pages17
JournalInformation and Computation
Volume144
Issue number1
DOIs
StatePublished - 10 Jul 1998

Bibliographical note

Funding Information:
* Partially supported by NSF Grant CCR-96-1070 and the Israel Ministry of Science and the Arts Grants 6297 and 8560. -Partially supported by NSF Grant CCR-96-23532. Supported by DIMACS under NSF Contract STC-88-09648.

Keywords

  • Analysis of algorithms
  • Multidimensional matching
  • Parallel algorithms
  • Period
  • String

Fingerprint

Dive into the research topics of 'Optimal Parallel Two Dimensional Text Searching on a CREW PRAM'. Together they form a unique fingerprint.

Cite this