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 language | English |
|---|---|
| Pages (from-to) | 1-17 |
| Number of pages | 17 |
| Journal | Information and Computation |
| Volume | 144 |
| Issue number | 1 |
| DOIs | |
| State | Published - 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.
Funding
* 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.
| Funders | Funder number |
|---|---|
| National Science Foundation | CCR-96-1070 |
| Center for Discrete Mathematics and Theoretical Computer Science | STC-88-09648 |
| Ministry of science and technology, Israel | CCR-96-23532 |
Keywords
- Analysis of algorithms
- Multidimensional matching
- Parallel algorithms
- Period
- String