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

Uzi Vishkin

Hardcover

ISBN 10: 0266919065 ISBN 13: 9780266919063

Publisher: Forgotten Books, 2018

Synopsis

Unlock faster string matching with a new approach to parallel processing

This book presents a clear, accessible look at how parallel computation can speed up pattern matching in strings. It explains models of concurrent writing and how these ideas translate into practical, scalable algorithms. Readers will see how a linear-time serial algorithm can fit into parallel frameworks to improve performance on large text data.

• Learn how different parallel models affect algorithm design and performance
• See step-by-step how strings and patterns are analyzed to find matches efficiently
• Understand the trade-offs between time and processor usage in parallel string matching
• Explore the theoretical foundations behind optimal patterns and data structures

Ideal for readers with an interest in algorithms, parallel computing, and efficient text processing who want a rigorous, approachable treatment of the topic.

Edition details

• Publisher: Forgotten Books
• Publication date: 2018
• Language: English
• ISBN 10: 0266919065
• ISBN 13: 9780266919063
• Binding: Hardcover
• Number of pages: 59