Silicon Press: Computer Algorithms (2/E)

Computer Algorithms (2/E)
by Horowitz, Sahni, & Rajasekaran
ISBN 978-0-929306-41-4
2008
804 pages, Paperback
$89.95 (US Dollars)
Author Bios: Horowitz, Sahni, Rajasekaran

Summary Reviews

Latest Edition of the Classic Algorithms Text!
Brand new edition of the programming language-independent text that helped establish computer algorithms as discipline of computer science -- a thoroughly revised and updated edition. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.

Computer Algorithms emphasizes:

Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
Examples: A wide range of examples provides students with the actual implementation of correct design.
The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.

Computer Algorithms is appropriate as a core text for upper- and graduate-level analysis of algorithms courses.

Table of Contents

Table of Contents