000			02118nam a2200241Ia 4500
008			140223b1998 xxu||||| |||| 00| 0 eng d
020			_a9788120313538 _c0.00
082			_a511.8 _bCOR
100			_aCormen, Thomas H.
245			_aIntroduction to Algorithms
260			_aNew Delhi _bPrentice-Hall of India Pvt. Ltd. _c1998
300			_a1028p
500			_aIntroduction 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
600			_aMathematics
700			_aLeiserson, Chales E.
700			_aRivest, Ronald L.
890			_aIndia
891			_aScience & Technology - Maths {QuickPic}
995			_ACOR _D275.00 _E0 _F049 _G16991 _H0 _I0.00 _UC _W19980611 _XBooks India _ZGeneral
995			_ACOR _D325.00 _E0 _F049 _G23663 _H0 _I0.00 _UC _W20010618 _XBooks India _ZGeneral
995			_ACOR _D325.00 _E0 _F049 _G23663 _H0 _I0.00 _UC _W20010618 _XBooks India _ZGeneral
995			_ACOR _D325.00 _E0 _F049 _G23663 _H0 _I0.00 _UC _W20010618 _XBooks India _ZReference
999			_c35360 _d35360