Parallel two dimensional witness computation

Authors:
Richard Cole;Zvi Galil;Ramesh Hariharan;S. Muthukrishnan;Kunsoo Park
Affiliations:
Computer Science Department, Courant Institute of Mathematical Sciences, NYU, 251 Marcer Street, New York, NY;Computer Science Department, Columbia University, 1214 Amsterdam Avenue, New York, NY;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012, India;AT&T Labs-Research, Florham Park, and Rutgers University, Piscataway, NJ;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, South Korea
Venue:
Information and Computation
Year:
2004

Citing 17
Cited 0

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Optimal parallel pattern matching in strings

Information and Control
Relations between concurrent-write models of parallel computation

SIAM Journal on Computing
An optimal O(log n)time parallel string matching algorithm

SIAM Journal on Computing
Deterministic sampling: a new technique for fast pattern matching

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
A lower bound for parallel string matching

SIAM Journal on Computing
The parallel simplicity of compaction and chaining

Journal of Algorithms
An Alphabet Independent Approach to Two-Dimensional Pattern Matching

SIAM Journal on Computing
Alphabet-Independent Two-Dimensional Witness Computation

SIAM Journal on Computing
Parallel Suffix--Prefix-Matching Algorithm and Applications

SIAM Journal on Computing
Constant-Time Randomized Parallel String Matching

SIAM Journal on Computing
Two-Dimensional Periodicity in Rectangular Arrays

SIAM Journal on Computing
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching

SIAM Journal on Computing
Optimal parallel two dimension text searching on a CREW PRAM4

Information and Computation
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Work-Time Optimal Parallel Prefix Matching (Extended Abstract)

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

An optimal parallel CRCW-PRAM algorithm to compute witnesses for all non-period vectors of an m1 × m2 pattern is given. The algorithm takes O(log log m) time and does O(m1 × m2) work, where m = max{m1, m2}. This yields a work optimal algorithm for 2D pattern matching which takes O(log log m) preprocessing time and O(1) text processing time.