OPTIMAL PARALLEL PATTERN MATCHING IN STRINGS (CLASSIC REPRINT)

Excerpt from Optimal Parallel Pattern Matching in StringsThere 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.About the PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully, any imperfections that remain are intentionally left to preserve the state of such historical works._,