Randomized Algorithms | 
 enlarge | Authors: Rajeev Motwani, Prabhakar Raghavan
Publisher: Cambridge University Press
Category: Book
List Price: $72.00
Buy New: $45.00
You Save: $27.00 (38%)
New (21) Used (16) from $39.00
Rating:  7 reviews
Sales Rank: 533941
Media: Hardcover
Pages: 492
Number Of Items: 1
Shipping Weight (lbs): 2.2
Dimensions (in): 10.1 x 7 x 1.1
ISBN: 0521474655
Dewey Decimal Number: 004.015192
EAN: 9780521474658
Publication Date: August 25, 1995
Availability: Usually ships in 1-2 business days
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.
Book Description
For many applications a randomized algorithm is the simplest algorithm available, or the fastest, or both. This book presents basic tools from probability theory used in algorithmic applications, with examples to illustrate the use of each tool in a concrete setting. Several important areas of application of randomized algorithms are explored in detail, giving a representative selection of the algorithms in these areas. Although written primarily as a text, this book should also prove invaluable as a reference for professionals and researchers.
|
| Customer Reviews: Read 2 more reviews...
 A subtle introduction to probablistic algoritms January 13, 2002
Philippe FLAJOLET (Le Chesnay, --- France)
27 out of 30 found this review helpful
This book is a jewel. It demonstrates how clever and beautifully simple probabilistic ideas can lead to the design of very efficient algorithms. I like its very verbal intuitive style,
with proof strategies being always transparently explained.
For computer scientists, this is *the* reference work in randomized algorithms, by now a major paradigm of algorithms design. For classical probabilists, this
could serve as an eye-opener on unsuspected applications of their field to important areas of computer science.
Great exploration of randomized algorithms March 18, 2008
L. James
1 out of 1 found this review helpful
A mathematician at heart in the world of software engineering, this is one of those few books that I take out from time to time and leave beside my bed. With it's wide scope it is sometimes terse and needs careful reading. Yet the world of randomized algorithms comes through with strength on a good formal basis. It is an entertaining and yet highly educational book.
A very good high-level survey of Randomized Algorithms December 8, 1998
8 out of 14 found this review helpful
I have just completed a graduate course using this book. At times the book is a bit terse (not necessarily a negative!) and overall I can highly recommend it.Wolf Bein, UNLV
extremely informative but obscure October 15, 1999
Johnny Wong (wongjoh@yahoo.com) (Berkeley, California)
17 out of 19 found this review helpful
I've taken two CS classes that use this book and I always felt like this book was very informative. The algorithms and concepts that Motwani brings forth are extremely insightful and interesting. However, the presentation of the proofs has a lot of room for improvement. Notation is carried over from previous chapters and is sometimes unexplained, which makes it very difficult for someone who does not have a lot of familiarity with the material presented. The book presents very interesting topics and leaves a lot of open (unresolved) questions to the reader's curiosity and challenge.
An enciclopedia for randomized algorithms. July 20, 2001
Gonen Benjamin (Jerusalem ISRAEL)
8 out of 10 found this review helpful
The book has an exoustive amount of algorithms. Not everything is proved. Sometimes the proof contains to few steps to be understood. There are many algorithms explained well. After reading this book it is easy to create your own randomized algorithms.
|
|
|
