Optimal parallel two dimensional pattern matching

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

Volumn , Issue , 1993, Pages 79-85

  Amir, Amihood ^a   Benson, Gary ^b   Farach, Martin ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c Center for Discrete Mathematics and Theoretical Computer Science   (United States)

Author keywords

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

Indexed keywords

PARALLEL ALGORITHMS; PATTERN MATCHING;

ANALYSIS OF ALGORITHMS; LOWER BOUNDS; MULTIDIMENSIONAL MATCHING; PERIOD; STRING; STRING MATCHING; TWO WAYS; TWO-DIMENSIONAL PATTERN MATCHING;

PARALLEL ARCHITECTURES;

EID: 84939942016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/165231.165242     Document Type: Conference Paper

References (20)

1. A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of the Third Ann. ACM-SIAM Symp. on Discrete Algorithms, Jan 1992.
2. A. Amir, G. Benson, and M. Farach. Alphabet independent two-dimensional matching. Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 59-68, 1992.
3. A. V. Aho and M. J. Corasick. Efficient string matching: An aid to bibliographic search. Comm. ACM, 18:333-340, 1975.
4. T. J. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comp, 7:533-541, 1978.
5. D. Breslauer and Z. Galil. An optimal o(log log n) time parallel string matching algorithm. SIAM J. Comput., 19:1051-1058, 1990.
6. R. S. Bird. Two dimensional pattern matching. Information Processing Letters, 6:168170, 1977.
7. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20:762772, 1977.
8. S.A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simulta-neus writes. SIAM Journal on Computing, 15(l):87-97, 1986.
9. M. Crochemore, Z. Galil, L. Gasieniec, S. Muthukrishnan, K. Park, H. Ramesh, and W. Rytter. Manuscript, 1993.
10. M. Crochemore, L. Gasieniec, and W. Rytter. Constant time optimal parallel algorithm for 2d-pattern matching. Manuscript, 1992.
11. F. Fich, R. Ragde, and A.Widgerson. Relations between concurrent-write models of parallel computation. SIAM J. Comput., 17:606-627, 1988.
12. Z. Galil. Open problems in stringology. In Z. Galil A. Apostolico, editor, Combinatorial Algorithms on Words, volume 12, pages 1-8. NATO ASI Series F, 1985.
13. Z. Galil. A constant-time optimal parallel string-matching algorithm. Proc. of the S4th Ann. ACM Symp. on Theory of Computing, pages 69-76, 1992.
14. Z. Galil and K. Park. Truly alphabet independent two-dimensional pattern matching. Proc. of the 33rd IEEE Annual Symp. on Foundation of Computer Science, 1992.
15. Z. M. Kedem, G. M. Landau, and K. V. Palem. Optimal parallel suffix-prefix matching algorithm and application. Proc. of the First Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 388-398, 1989.
16. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
17. S. Muthukrishnan and H. Ramesh. A constant time optimal parallel algorithm for two dimensional pattern matching. Manuscript, 1992.
18. A. Rosenfeld and A.C. Kak. Digital Picture Processing. Academic Press, New York, 1982.
19. U. Vishkin. Optimal parallel pattern matching in strings. Proc. 12th ICALP, pages 91113, 1985.
20. U. Vishkin. Deterministic sampling-a new technique for fast pattern matching. SIAM J. Comp., 20:303-314, 1991.