Fundamentals of Sequential and Parallel Algorithms

by Kenneth A. Berman, Jerome L. Paul

Professors Berman and Paul give students a comprehensive tool kit of sequential and parallel algorithms, plus a set of mathematical techniques for assessing the performance and correctness of algorithms. Their balanced, integrated presentation of sequential and parallel algorithms helps students gain a more intuitive ability to select appropriate algorithms from a variety of alternatives. The authors determine worst, best, and average running times for the algorithms covered. For both Parallel Random Access Machines and interconnection network models, they present algorithms in parallel pseudocode.

744 pages, Hardcover

First published August 23, 1996

Reviews

[Darrell Ulm · Rating 5 out of 5]

Excellent book on algorithms, both sequential and parallel.