Optimal Parallel Pattern Matching in Strings (Classic Reprint) - Hardcover

Uzi Vishkin

 
9780266919063: Optimal Parallel Pattern Matching in Strings (Classic Reprint)

Synopsis

Excerpt from Optimal Parallel Pattern Matching in Strings<br/><br/>There are two known linear time serial algorithms for this extensively studied problem, due to [em — 77] and [kmp Recall that every parallel linear algorithms is, in particular, a linear time serial algorithm. The present result is stronger than theirs in the sense that it gives a parallel linear algorithm while theirs serial algorithms do not seem to imply satisfactory parallel linear algorithms. Moreover, our algorithm is not more complicated than theirs. Some parts of it (particularly, the analysis of the text) are even considerably simpler....

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title