Optimal parallel two dimensional pattern matching

Amihood Amir, Gary Benson, Martin Farach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

We present a parallel algorithm for two dimensional matching. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(logm) on a CREW PRAM, thus matching the lower bound for string matching on a PRAM without concurrent writes. On a CRCW, the algorithm runs in time O(loglogro). Finding such an algorithm was a problem posed in 1985 and has been open since.

Original languageEnglish
Title of host publicationProceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993
PublisherAssociation for Computing Machinery, Inc
Pages79-85
Number of pages7
ISBN (Electronic)0897915992, 9780897915991
DOIs
StatePublished - 1 Aug 1993
Externally publishedYes
Event5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993 - Velen, Germany
Duration: 30 Jun 19932 Jul 1993

Publication series

NameProceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

Conference

Conference5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993
Country/TerritoryGermany
CityVelen
Period30/06/932/07/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Keywords

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

Fingerprint

Dive into the research topics of 'Optimal parallel two dimensional pattern matching'. Together they form a unique fingerprint.

Cite this