Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint) - Hardcover
Synopsis
Unlock parallel speed with proven techniques for designing fast algorithms.
This book offers a practical framework for solving complex problems in parallel, using a structured approach that scales with many processors.
This work presents general methods for divide-and-conquer that apply beyond simple merges. It shows how to model problems as trees, manage ordered data, and keep operations efficient even when combining subresults. Readers will see how to apply these ideas to geometric problems and data structures, always with an emphasis on time and processor efficiency.- General cascading merges that run in optimal time using many processors
- Parallel fractional cascading and its adaptation to new data structures
- Techniques for planar geometry problems like trapezoidal decomposition and point location
- Applications to 3D maxima, dominance counting, and visibility problems
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Cascading Divide-and-Conquer: A Technique for Designing...
Stock Image
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780331592252
Stock Image
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780331592252
Buy New
US$ 31.00
US$ 5.61 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available