Limit search to available items
Book Cover
Author Cormen, Thomas H.

Title Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Published Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, [1990]


Location Call no. Vol. Availability
 W'PONDS  005.1 Cor/Ita  AVAILABLE
Description xvii, 1028 pages : illustrations ; 26 cm
Series MIT electrical engineering and computer science series
MIT electrical engineering and computer science series.
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
Summary This book covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics
Analysis Algorithms
Computer algorithms
Computer programming
Notes Includes index
Bibliography Includes bibliographcal references (pages [987]-996) and index
Subject Algorithms.
Computer algorithms.
Computer programming.
Programming (Computers)
Author Leiserson, Charles Eric.
Rivest, Ronald L.
LC no. 89013027
ISBN 0070131430 (McGraw-Hill)
0262031418 (MIT Press)
Other Titles Algorithms