TY  - BOOK
AU  - Cormen, Thomas H.
AU  - Leiserson, Charles E. ;Rivest, Ronald L. 
TI  - Introduction to algorithms
SN  - 9780070131439
AV  - QA 76.6 .C67 1990 
PY  - 1990///
CY  - New York
PB  - McGraw Hill Education
KW  - ALGORITHMES
N1  - Includes index; 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
N2  - 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
ER  -