Jump to ratings and reviews
Rate this book

Optimal Parallel Pattern Matching in Strings

Rate this book
Excerpt from Optimal Parallel Pattern Matching in Strings

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.

57 pages, Paperback

Published January 1, 2024

About the author

Uzi Vishkin

29 books

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.