Randomized Algorithms (Hardcover)

by Rajeev Motwani (Author), Prabhakar Raghavan (Author) "CONSIDER sorting a set S of n numbers into ascending order..." (more)
Key Phrases: competitiveness coefficient, random treap, adaptive online adversary, Las Vegas, Monte Carlo, Research Problem (more...)

Editorial Reviews

Review
"The techniques described by Rajeev Motwani and Prabhaker Raghavan are wide-ranging and powerful, so this book is an important one...We are particularly lucky, therefore, that this excellent volume does us so proud!...clearly written and well thought out, with an interesting collection of exercises and applications, and shows the comprehensive breadth and valuable insights of a mature text...I would recommend the book both to newcomers to the field and to more seasoned practitioners...It is a pleasure to read." John H. Halton, American Scientist

"...the first comprehensive account of the current state of this burgeoning subject...Every aspect of this book...shows evidence of ample thoughtfulness...an essential acquisition..." D.V. Feldman, Choice

"Randomization has come to be recognized as a fundamental tool for the construction of simple and efficient algorithms. Motwani and Raghavan provide an excellent overview of randomized techniques in algorithm construction, demonstrating their impact on virtually every domain in which computation is done. This book will surely exert a powerful influence on the way algorithm design is practiced and taught." Richard M. Karp

"This is an authoritative work by researchers active in the field. The book is welcome as a reference work, as a source book for algorithmic ideas, and as a graduate-level course text....In the latter role, the book is greatly enhanced by the provision of numerous exercises scattered throughout the text (to test and deepen the reader's understanding), together with extensive selections of harder problems at the end of each chapter. The continued attention of seasoned researchers is assured by the inclusion of a number of open research problems. This is very much an active research area, and if newcomers are attracted into it through reading this book, then it will have served an additional useful purpose." Mark R. Jerrum, Mathematical Reviews

"The book can serve as an excellent basis for a graduate course. It is also highly recommended for students and researchers who wish to deepen their knowledge of the subject." Y. Aumann, Computing Reviews

"...carefully written, with exact definitions and complete proofs.... I believe that the book, with its vast coverage, will be an invaluable source for active researchers in the field." Y. Aumann, Theory of Computation

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.

See all Editorial Reviews

Product Details

• Hardcover: 492 pages
• Publisher: Cambridge University Press (August 25, 1995)
• Language: English
• ISBN-10: 0521474655
• ISBN-13: 978-0521474658
• Product Dimensions: 10.1 x 7 x 1.1 inches
• Shipping Weight: 2.2 pounds (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars See all reviews (7 customer reviews)
• Amazon.com Sales Rank: #232,269 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #21 in	Books > Professional & Technical > Professional Science > Mathematics > Applied > Stochastic Modeling
  #55 in	Books > Science > Mathematics > Pure Mathematics > Discrete Mathematics
  #59 in	Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Discrete Mathematics

Customer Reviews

Most Helpful Customer Reviews

29 of 32 people found the following review helpful:

5.0 out of 5 stars A subtle introduction to probablistic algoritms, January 13, 2002

By	Philippe FLAJOLET "philippeflajolet" (Le Chesnay, --- France) - See all my reviews

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.

18 of 20 people found the following review helpful:

4.0 out of 5 stars extremely informative but obscure, October 15, 1999

By	Johnny Wong (Flushing, NY) - See all my reviews (REAL NAME)

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.

8 of 10 people found the following review helpful:

4.0 out of 5 stars An enciclopedia for randomized algorithms., July 20, 2001

By	Gonen Benjamin "benygo" (Jerusalem ISRAEL) - See all my reviews

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.