### Abstract

The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m^{1+ε}+n^{1+ε}) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log^{2}m(log log m)^{3}) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

Original language | English (US) |
---|---|

Title of host publication | Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings |

Editors | Eli Shamir, Serge Abiteboul |

Publisher | Springer-Verlag |

Pages | 203-214 |

Number of pages | 12 |

ISBN (Print) | 9783540582014 |

State | Published - Jan 1 1994 |

Event | Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr Duration: Jul 1 1994 → Jul 1 1994 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 820 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 |
---|---|

City | Jerusalem, Isr |

Period | 7/1/94 → 7/1/94 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings*(pp. 203-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 820 LNCS). Springer-Verlag.

**Optimal parallel algorithms for prefix matching.** / Hariharan, Ramesh; Muthukrishnan, Shanmugavelayutham.

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

*Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 820 LNCS, Springer-Verlag, pp. 203-214, Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94, Jerusalem, Isr, 7/1/94.

}

TY - GEN

T1 - Optimal parallel algorithms for prefix matching

AU - Hariharan, Ramesh

AU - Muthukrishnan, Shanmugavelayutham

PY - 1994/1/1

Y1 - 1994/1/1

N2 - The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

AB - The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

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

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

M3 - Conference contribution

AN - SCOPUS:21344498092

SN - 9783540582014

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 203

EP - 214

BT - Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings

A2 - Shamir, Eli

A2 - Abiteboul, Serge

PB - Springer-Verlag

ER -