000 | 01386nam a22002297a 4500 | ||
---|---|---|---|
008 | 200611b2019 ||||| |||| 00| 0 eng d | ||
020 | _a9781108721998 | ||
082 | _a005.1 SEN-S | ||
100 | _aSen, Sandeep | ||
245 |
_aDesign and analysis of algorithms : _ba contemporary perspective / _cSandeep Sen and Amit Kumar |
||
260 |
_aIndia _bCambridge University Press _c2019 |
||
300 | _a367 p. | ||
365 |
_aINR _b695.00. |
||
500 | _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 | _aLogic | ||
650 | _aMathematics | ||
650 | _aAlgebra | ||
650 | _aComputer science | ||
650 | _aGeometry | ||
700 | _aKumar, Amit | ||
999 |
_c65615 _d65615 |