000			02100nam a22002297a 4500
999			_c55467 _d55467
005			20191210114434.0
008			191001b ||||| |||| 00| 0 eng d
020			_a9781108721998
028			_aVariety Books Publishers Distributors _b;B-10,Street No-02,West Vinod Nagar ,Delhi-110092 _c;IM2598 _d;25/09/2019
082			_a005.1 SEN
100			_aSandeep Sen _a; Amit Kumar
245			_aDesign and Analysis of Algorithms _b: a contemporary perspective. _c/Sandeep Sen
260			_aCambridge _b:Cambridge University Press _c,2019.
300			_axxvi,367 Pages _c;25 cm.
365			_b695
505			_a Preface; Acknowledgement; 1. Model and analysis; 2. Basics of probability and tail inequalities; 3. Warm up problems; 4. Optimization I: brute force and greedy strategy; 5. Optimization II: dynamic programming; 6. Searching; 7. Multidimensional searching and geometric algorithms; 8. String matching and finger printing; 9. Fast Fourier transform and applications; 10. Graph algorithms; 11. NP completeness and approximation algorithms; 12. Dimensionality reduction; 13. Parallel algorithms; 14. Memory hierarchy and caching; 15. Streaming data model; Appendix A. Recurrences and generating functions; Index.
520			_a The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
650			_aAlgorithms
655			_aComputer science
700			_aAmit Kumar
942			_cBOOK