Items related to Optimal Parallel Pattern Matching in Strings (Classic...
Synopsis
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.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This 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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Optimal Parallel Pattern Matching in Strings (Classic...
Seller Image
Optimal Parallel Pattern Matching in Strings (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents a new approach to parallel pattern matching in strings. The author presents a linear-time algorithm for finding all occurrences of a pattern in a text. The algorithm runs in O(n/p) time using any number of p ⤠n/log n processors on a concurrent-read concurrent-write parallel random-access machine. This algorithm is optimal in the sense that it achieves the best possible running time for this problem on this type of parallel machine. The author also discusses the importance of this problem and its applications in various fields such as text processing, computational biology, and data mining. Overall, this book provides a comprehensive and in-depth analysis of parallel pattern matching in strings, making it a valuable resource for researchers and practitioners in the field. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781528511964_0
Quantity: Over 20 available
Stock Image
Optimal Parallel Pattern Matching in Strings (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781528511964
Quantity: 15 available
Stock Image
Optimal Parallel Pattern Matching in Strings (Classic Reprint)
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781528511964
Quantity: 15 available
Stock Image
Optimal Parallel Pattern Matching in Strings (Classic Reprint)
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 30282180/1
Quantity: 1 available