Research Catalog

Title

Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.

Author

Cormen, Thomas H.

Publication

• Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, [1990]
• ©1990

Items in the Library & Off-site

Details

Additional Authors

• Leiserson, Charles Eric.
• Rivest, Ronald L.

Description

xvii, 1028 pages : illustrations; 26 cm.

Summary

This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a "pseudocode" designed to be readable by anyone who has done a little programming. The book contains over 260 figrues illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals. --

Series Statement

The MIT electrical engineering and computer science series

Uniform Title

MIT electrical engineering and computer science series

Alternative Title

Algorithms.

Subjects

• Programmation (informatique)
• Algorithmes
• Algorithms
• Computer programming
• Algoritmen
• Computer algorithms
• algorithms
• computer programming

Bibliography (note)

• Includes bibliographcal references (p. [987]-996) and index.

Contents

Growth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.

ISBN

• 0262031418
• 9780262031417
• 0070131430
• 9780070131439
• 0262530910
• 9780262530910

LCCN

89013027

OCLC

• ocm20219489
• 20219489
• SCSB-1919296

Owning Institutions

Princeton University Library