TY  - BOOK
AU  - Cormen, Thomas H
AU  - Leiserson, Charles E.
AU  - Rivest, Ronald L.
AU  - Stein, Clifford
TI  - Introduction to algorithms
SN  - 9788120340077
U1  - 005.1 
PY  - 2008///
PY  - 2010///
CY  - New Delhi.
PB  - PHI Learning pvt. ltd.
KW  - Computer science, alogrithms
N1  - Computer Science; Contents:
Preface;
FOUNDATIONS:
Introduction:
1. The Role of Algorithms in Computing
2. Getting Started
3. Growth of Functions
4. Divide-and-Conquer
5. Probabilistic Analysis and Randomized Algorithms
SORTING AND ORDER STATISTICS:
Introduction:
6. Heapsort
7. Quicksort
8. Sorting in Linear Time
9. Medians and Order Statics
DATA STRUCTURES:
Introduction:
10. Elementary Data Structures
11. Hash Tables
12. Binary Search Trees
13. Red-Black Trees
14. Augmenting Data Structures
ADVANCED DESIGN AND ANALYSIS TECHNIQUES:
Introduction:
15. Dynamic Programming
16. Greedy Algorithms
17. Amortized Analysis
ADVANCED DATA STRUCTURES:
Introduction:
18. B-Trees
19. Fibonacci Heaps
20. Van Emde Boas Trees
21. Data Structures for Disjoint Sets
GRAPH ALGORITHMS:
Introduction:
22. Elementary Graph Algorithms
23. Minimum Spanning Trees
24. Signal-Source Shortest Paths
25. All-Pairs Shortest Paths
26. Maximum Flow
SELECTED TOPICS:
Introduction:
27. Multithreaded Algorithms
28. Matrix Operations
29. Linear Programming
30. Polynomials and the FFT
31. Number-Theoretic Algorithms
32. String Matching
33. Computational Geometry
34. NP-Completeness
35. Approximation Algorithms

N2  -  Algorithms, algorithms in computing
ER  -