TY  - BOOK
AU  - Miller, Russ.
AU  - Boxer, Laurence
TI  - Algorithms sequential and parallel: a unified approach 
SN  - 9781133366805
AV  - QA 76.9.A43 .M55 2013 
PY  - 2013///
CY  - Boston, Massachusetts
PB  - Cengage Learning Asia Pte Ltd
KW  - PARALLEL ALGORITHMS
N1  - Includes bibliographical references (pages 403-407) and index; Discrete Mathematics Reference Guide. 1. Asymptotic Analysis. 2. Induction and Recursion. 3. The Master Method. 4. Models of Computation. 5. Combinational Circuits. 6. Matrix Operations. 7. Parallel Prefix. 8. Pointer Jumping. 9. Divide-and-Conquer. 10. Computational Geometry. 11. Image Processing. 12. Graph Algorithms. 13. Numerical Problems. Appendix 1: Proof of Mathematical Induction. Appendix 2: Proof of Master Theorem. Appendix 3: Proof of Expected Running Time of Quicksort. Appendix 4: Expected-Case Running Time of Quicksort
N2  - Equip yourself for success with a state-of-the-art approach to algorithms available only in Miller/Boxer's ALGORITHMS SEQUENTIAL AND PARALLEL: A UNIFIED APPROACH, 3E. This unique and functional text gives you an introduction to algorithms and paradigms for modern computing systems, integrating the study of parallel and sequential algorithms within a focused presentation. With a wide range of practical exercises and engaging examples drawn from fundamental application domains, this book prepares you to design, analyze, and implement algorithms for modern computing systems
ER  -