Algorithms sequential and parallel : a unified approach / Russ Miller and Laurence Boxer.
Material type:
- 9781133366805
- QA 76.9.A43 .M55 2013

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.9.A43 .M55 2013 (Browse shelf(Opens below)) | c.1 | Available | NULIB000006703 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
No cover image available | ||
GC QA 76.9.A25 .C65 2011 Computer forensics jumpstart / | GC QA 76.9.A43 .G69 2010 Design and analysis of algorithm / | GC QA 76.9.A43 .L48 2012 Introduction to the design and analysis of algorithms / | GC QA 76.9.A43 .M55 2013 Algorithms sequential and parallel : a unified approach / | GC QA 76.9.A43 .M64 2012 Design and analysis of algorithms / | GC QA 76.9.A73 .D48 2010 Introduction to 80x86 assembly language and computer architecture / | GC QA 76.9.A73 .H36 1996 Computer organization / |
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.
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.
There are no comments on this title.