Algorithms Sequential & Parallel: A Unified Approach - Hardcover

Russ Miller is Distinguished Professor of Computer Science and Engineering, Head of the Cyberinfrastructure Laboratory, and Founding Director (1998-2006) of SUNY-Buffalo's world-class Center for Computational Research. Dr. Miller also maintains appointments in the Department of Electrical Engineering and the Department of Structural Biology at the Hauptman-Woodward Medical Research Institute. Dr. Miller has produced seminal work in areas of parallel algorithms for the mesh, pyramid, hypercube, and reconfigurable architectures covering domains that include computational geometry, image analysis, and fundamental data movement operations. Professor Miller's has over 200 publications, including peer-reviewed papers, chapters, and abstracts of presentations at national and international conferences. He has also authored 2 textbooks covering parallel and sequential algorithms. His Shake-and-Bake was listed on the IEEE poster "Top 10 Algorithms of the 20th Century." Dr. Miller is a fellow of the Institute Electrical and Electronics Engineers (IEEE) and a member of the European Academy of Sciences.

Laurence Boxer is Professor and past chair of the Department of Computer and Information Sciences at Niagara University and is Research Professor of Computer Science and Engineering at SUNY-Buffalo. He is a past member of the editorial board of the Journal of Computing and Information and has authored and co-authored numerous journal articles and conference proceedings papers in algorithms for computational geometry, image processing, and string pattern matching as well as in digital topology.

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.