Cascading Divide-and-Conquer (Classic Reprint): A Technique for Designing Parallel Algorithms: A Technique for Designing Parallel Algorithms (Classic Reprint) - Softcover
Synopsis
Learn powerful, parallel techniques to solve complex problems faster, with clear, general methods you can apply across geometry and data structures.
This book presents a practical framework for solving large problems in parallel by adapting the divide-and-conquer approach. It focuses on how to organize work, manage complex merges, and maintain efficiency across multiple processors, with many concrete techniques you can transfer to real-world challenges. The discussion centers on geometric problems, but the methods generalize to a wide range of tasks in computer science.
- General techniques for parallel divide-and-conquer and cascading merges
- How to handle partial orders and maintain efficient, sortable structures in parallel
- Applications to trapezoidal decomposition, planar point location, and segment intersection
- Optimization results that achieve time and processor bounds close to theoretical limits
"synopsis" may belong to another edition of this title.
About the Author
Atallah, Computer Science Department, Purdue University, West Lafayette, Indiana.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Seller Image
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents a powerful technique called cascading divide-and-conquer, a set of efficient algorithms for solving geometric problems in parallel. It improves on existing methods by offering reduced time complexity for a wide range of problems, including segment intersection detection, trapezoidal decomposition, and planar point location. The book also introduces new techniques: fractional cascading, and plane sweep tree construction. It shows how to apply cascading divide-and-conquer to solve the challenging 3D maxima, 2-set dominance counting, and visibility from a point problems. All of the algorithms presented run in O (log n) time with either linear or sub-linear processors in the CREW PRAM model. 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 # 9781332870325_0
Buy New
£ 13.64
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
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 # LW-9781332870325
Stock Image
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
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 # LW-9781332870325
Buy New
£ 20.41
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available