Highly Efficient Dictionary Matching in Parallel

Abstract

We present highly efficient parallel algorithms for several well-studied dictionary matching problems. Our algorithms are faster and more efficient in terms of their parallel work, compared to previously known results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1993
Accession Number
AD1020201

Entities

People

  • K. Palem
  • S. Muthukrishnan

Organizations

  • Courant Institute of Mathematical Sciences, NYU

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Dictionaries

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics