Randomized algorithms

By:

Motwani, Rajeev

Contributor(s):

Raghavan, Prabhakar

Material type: Text

TextPublication details: Cambridge University Press New Delhi 2018Description: xiv, 476 pISBN:

9780521613903

Subject(s):

Algorithms

DDC classification:

005.1 MOT

Summary: DescriptionContentsResourcesCoursesAbout 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)

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Book	Indian Institute of Management LRC General Stacks	Operations Management & Quantitative Techniques	005.1 MOT (Browse shelf(Opens below))	1	Available		005865

DescriptionContentsResourcesCoursesAbout 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)

There are no comments on this title.

to post a comment.