000			01911nam a22001937a 4500
005			20240215154409.0
008			240215b |||||||| |||| 00| 0 eng d
020			_a9780521613903
082			_a005.1 _bMOT
100			_aMotwani, Rajeev _915871
245			_aRandomized algorithms
260			_bCambridge University Press _aNew Delhi _c2018
300			_axiv, 476 p.
365			_aINR _b1350.00
520			_aDescriptionContentsResourcesCoursesAbout the Authors For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students. Only book currently published in the growing field of randomized algorithms Topic has applications in computer science, operations research, mathematics and statistics Practical and self-contained Written by two well-known researchers in the field (https://www.cambridge.org/in/universitypress/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/randomized-algorithms?format=HB&isbn=9780521474658)
650			_aAlgorithms _915872
700			_aRaghavan, Prabhakar _915873
942			_cBK _2ddc
999			_c6652 _d6652