TY  - BOOK
AU  - Cormen, Thomas H.
AU  - Leiserson, Chales E.
AU  - Rivest, Ronald L.
TI  - Introduction to Algorithms
SN  - 9788120313538
U1  - 511.8 
PY  - 1998///
CY  - New Delhi
PB  - Prentice-Hall of India Pvt. Ltd.
KW  - Mathematics
N1  - Introduction Part - 1: Mathematical Foundations Growth of Functions Summations Recurrences Sets Etc Counting and Probability Part - 2: Sorting and Order Statistics Heapsort Quicksort Sorting in Linear Time Medians and Order Statistics Part - 3: Data Structures Elementary Data Structures Hash Tables Binary Search Trees Red Black Trees Augmenting Data Structures Part - 4: Advanced Design and Analysis Techniques Dynamic Programming Greedy Algorithms Amortized Analysis Part - 5: Advanced Data Structures B Trees Binomial Heaps Fibonacci Heaps Data Structures for Disjoint Sets Part - 6: Graph Algorithms Elementary Graph Theory Minimum Spanning Trees Single Source Shortest Paths All Pairs Shortest Paths Maximum Flow Part - 7: Selected Topics 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 Bibliography Index
ER  -