Russ Miller, State University of New York
Laurence Boxer, Niagara University

Coming November, 1999 by Prentice Hall Engineering/Science/Mathematics

Copyright 2000, 336 pp.
Cloth
ISBN 0-13-086373-4
$60.00

Sign up for future
mailings on this subject.

See other books about:
    Computer Programming

Reflecting the growing importance of parallel computing in mainstream computer technology, this book offers a fully integrated study of parallel and sequential algorithms—helping readers understand the application and analysis of algorithmic paradigms to both the (traditional) sequential model of computing and to a variety of parallel models, and showing them how solution strategies may be shared among computer architectures.

Relates/contrasts sequential and parallel algorithms where appropriate (i.e., covers a paradigm—such as divide-and-conquer—and then considers design, analysis, and implementation issues for both the sequential and parallel models). Reviews mathematical concepts and develops mathematical tools early on—including asymtotic analysis, induction and recursion, and Master Method; provides a broad variety of architectures and application areas (including matrix operations, computational geometry, graphing algorithms, and numerical problems). Offers many illustrations, exercises, and worked examples. Assumes basic knowledge of data structures, discrete mathematics and calculus.

1. Asymptotic Analysis.
2. Induction and Recursion.
3. The Master Method.
4. Combinational Circuits.
5. Models of Computation.
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.
Bibliography.
Index.