Computational Math, MIT Fall 08 Textbooks
Randomized Algorithms
MIT Course Number:
6.856
Author:
Motwani, Rajeev; Raghavan, Prabhakar
Isbn 13:
9780521474658
ISBN: 0521474655
Pub Date:
Aug 1, 1995
Publisher:
Cambridge University Press
Shipping Weight: 2.50 pounds
Status:
In stock ships within 1 day
Quantum Price: $62.10
Quantity in Basket: None
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 first book on the subject should prove invaluable as a reference for researchers and professional programmers, as well as for students.
view
more info, including table of contents
(opens in pop-up window)
