Optimal parallel two dimensional pattern matching

Amihood Amir; Gary Benson; Martin Farach

doi:10.1145/165231.165242

Optimal parallel two dimensional pattern matching

Amihood Amir, Gary Benson, Martin Farach

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993
Publisher	Association for Computing Machinery, Inc
Pages	79-85
Number of pages	7
ISBN (Electronic)	0897915992, 9780897915991
DOIs	https://doi.org/10.1145/165231.165242
State	Published - 1 Aug 1993
Externally published	Yes
Event	5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993 - Velen, Germany Duration: 30 Jun 1993 → 2 Jul 1993

Publication series

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

Conference

Conference	5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993
Country/Territory	Germany
City	Velen
Period	30/06/93 → 2/07/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Funding

“College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280; (404) 853-0083, am@@cc,gatech,edu; Par-tlsily supported by NSF grant IRI-90-13055 ‘Department of Mathematics, University of Southern California, DRB 155, 1024 W 36th , Los Angeles, CA 90089-1113, (213) 740-2404; gbenson@htc-03. usc.edu; Part]slly supported NSF grants IRI-90-13055 and DMS-90-05833. ‘DIMACS, Box 1179, Rutgers University, Piscataway, 0S855; (908) 932-5928; faracht?ldimacs. rutgers.edu, Supported by DIMACS under NSF contract STCSS-09648

Funders	Funder number
National Science Foundation	IRI-90-13055, CA 90089-1113, DMS-90-05833
Center for Discrete Mathematics and Theoretical Computer Science	STCSS-09648

Keywords

Analysis of algorithms
Multidimensional matching
Parallel algorithms
Period
String

Access to Document

10.1145/165231.165242

Cite this

Amir, A., Benson, G., & Farach, M. (1993). Optimal parallel two dimensional pattern matching. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993 (pp. 79-85). (Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993). Association for Computing Machinery, Inc. https://doi.org/10.1145/165231.165242

@inproceedings{e4803588294b44df864d83e5762900fc,

title = "Optimal parallel two dimensional pattern matching",

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.",

keywords = "Analysis of algorithms, Multidimensional matching, Parallel algorithms, Period, String",

author = "Amihood Amir and Gary Benson and Martin Farach",

note = "Publisher Copyright: {\textcopyright} 1993 ACM.; 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993 ; Conference date: 30-06-1993 Through 02-07-1993",

year = "1993",

month = aug,

day = "1",

doi = "10.1145/165231.165242",

language = "אנגלית",

series = "Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993",

publisher = "Association for Computing Machinery, Inc",

pages = "79--85",

booktitle = "Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993",

}

Amir, A, Benson, G & Farach, M 1993, Optimal parallel two dimensional pattern matching. in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993. Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993, Association for Computing Machinery, Inc, pp. 79-85, 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993, Velen, Germany, 30/06/93. https://doi.org/10.1145/165231.165242

Optimal parallel two dimensional pattern matching. / Amir, Amihood; Benson, Gary; Farach, Martin.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993. Association for Computing Machinery, Inc, 1993. p. 79-85 (Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal parallel two dimensional pattern matching

AU - Amir, Amihood

AU - Benson, Gary

AU - Farach, Martin

PY - 1993/8/1

Y1 - 1993/8/1

N2 - 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.

AB - 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.

KW - Analysis of algorithms

KW - Multidimensional matching

KW - Parallel algorithms

KW - Period

KW - String

UR - http://www.scopus.com/inward/record.url?scp=84939942016&partnerID=8YFLogxK

U2 - 10.1145/165231.165242

DO - 10.1145/165231.165242

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84939942016

T3 - Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

SP - 79

EP - 85

BT - Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

PB - Association for Computing Machinery, Inc

T2 - 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

Y2 - 30 June 1993 through 2 July 1993

ER -

Optimal parallel two dimensional pattern matching

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this