000			a
999			_c29651 _d29651
008			190910b xxu||||| |||| 00| 0 eng d
020			_a9781108721998
082			_a005.1 _bSEN
100			_aSen, Sandeep
245			_aDesign and analysis of algorithms : a contemporary perspective
260			_bCambridge University Press _c2019 _aCambridge
300			_axxvi, 367 p. _bill. _c24 cm
365			_b695.00 _cINR _d00
504			_aIncludes bibliographical references and index.
520			_aThe 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
650			_aGeometric algorithms
650			_aComputer Programming
710			_aKumar, Amit
942			_2ddc _cBK