|
The objectives of this book are to provide a solid foundation for the classical the
ory of sequential algorithms and to cover some of the most important recent al
gorithmic developments, including the rapidly advancing theory of parallel and
distributed algorithms. The book is intended to serve as a text for a core upper
division undergraduate course or first-year graduate course in the design and
analysis of algorithms.
While parts of the book are revised and updated versions of text taken from
the authors' previous book, Fundamentals of Sequential and Parallel Algorithms, we
have added a significant amount of new material, including an introduction to
Internet and distributed algorithms. Also, the material on parallel algorithms
that was integrated throughout the previous book has now been moved to a sep
arate part on parallel and distributed algorithms. This separation enables the in
structor to cover as little or as much of the parallel material as desired. Another
new feature is the inclusion of a number of appendices containing ancillary ma
terial, such as a review of mathematical prerequisites. Placing this material in ap
pendices keeps the text more sharply focused on algorithmic issues.
Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Paul's text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students' ability to think independently. |
|
|
|
