Optimal Parallel Pattern Matching in Strings Classic Reprint
Uzi Vishkin
Sold by PBShop.store US, Wood Dale, IL, U.S.A.
AbeBooks Seller since April 7, 2005
New - Hardcover
Condition: New
Ships within U.S.A.
Quantity: 15 available
Add to basketSold by PBShop.store US, Wood Dale, IL, U.S.A.
AbeBooks Seller since April 7, 2005
Condition: New
Quantity: 15 available
Add to basketNew Book. Shipped from UK. Established seller since 2000.
Seller Inventory # LX-9780266919063
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.
"About this title" may belong to another edition of this title.
Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...
Books are shipped from UK warehouse. Delivery thereafter is between 4 and 14 business days dependant upon your location - please do contact us with any queries you may have.
| Order quantity | 7 to 14 business days | 7 to 14 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 0.00 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.