TY  - BOOK
AU  - Cormen,Thomas H.
AU  - Leiserson,Charles Eric
AU  - Rivest,Ronald L.
TI  - Introduction to algorithms.
SN  - 0262031418
AV  - QA76.6.C662 
U1  - 005.1 20
PY  - 1990///
CY  - Cambridge, Mass., New York
PB  - MIT Press, McGraw-Hill
KW  - Computer programming
KW  - Computer algorithms
N1  - Includes bibliographcal references (p. [987]-996) and index; Contents: Introduction -- Mathematical foundations: Introduction: Growth of functions -- Summations -- Recurrences -- Sets, etc -- Counting and probability -- Sorting and order statistics: Introduction: Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Data structures: Introduction: Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Advanced design and analysis techniques: Introduction:Dynamic programming -- Greedy algorithm -- Amortized analysis -- Adavnced data structures: Introduction: B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoints sets -- Graph algorithm: Introduction: Elementary graph algorithm -- Minimum spannin trees -- Single-source shortest paths -- Maximum flow -- Selected topics: Introduction: Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the EFT -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms
ER  -