000			01939nam a2200349 i 4500
001			CR9781108654937
003			UkCbUP
005			20240906184332.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			180502s2019||||enk o ||1 0|eng|d
020			_a9781108654937 (ebook)
020			_z9781108496827 (hardback)
020			_z9781108721998 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.58 _b.S454 2019
082	0	0	_a005.1 _223
100	1		_aSen, Sandeep, _eauthor.
245	1	0	_aDesign and analysis of algorithms : _ba contemporary perspective / _cSandeep Sen, Amit Kumar.
264		1	_aCambridge : _bCambridge University Press, _c2019.
300			_a1 online resource (xxvi, 367 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 02 May 2019).
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		0	_aAlgorithms.
700	1		_aKumar, Amit, _d1976- _eauthor.
776	0	8	_iPrint version: _z9781108496827
856	4	0	_uhttps://doi.org/10.1017/9781108654937
942			_2ddc _cEB
999			_c9894 _d9894