TY  - BOOK
AU  - Cormen,Thomas H.
TI  - Introduction to algorithms
SN  - 0262032937 (hbk. : alk. paper)
AV  - QA76.6 .C662 2001
U1  - 005.1 21
PY  - 2001///
CY  - Cambridge, Mass.
PB  - MIT Press
KW  - Computer programming
KW  - Computer algorithms
N1  - Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990; Includes bibliographical references (p. [1127]-1130) and index; The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- 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 -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability
ER  -