Programming Books C Java PHP Python Learn more Browse Programming Books
Randomized Algorithms and over one million other books are available for Amazon Kindle. Learn more
  • List Price: $94.99
  • Save: $39.97 (42%)
Rented from apex_media
To Rent, select Shipping State from options above
Due Date: May 29, 2015
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Used: Like New | Details
Sold by Red Tiger Books
Condition: Used: Like New
Comment: New condition, ships fast.
Access codes and supplements are not guaranteed with used items.
Qty:1
  • List Price: $94.99
  • Save: $22.80 (24%)
Only 6 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Randomized Algorithms has been added to your Cart
Sell yours for a Gift Card
We'll buy it for $10.35
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Randomized Algorithms Hardcover – August 25, 1995

ISBN-13: 978-0521474658 ISBN-10: 0521474655 Edition: 1ST

Buy New
Price: $72.19
Rent
Price: $55.02
27 New from $65.00 27 Used from $51.75 1 Collectible from $128.31
Amazon Price New from Used from
eTextbook
"Please retry"
Hardcover
"Please retry"
$72.19
$65.00 $51.75
Paperback
"Please retry"
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

$72.19 FREE Shipping. Only 6 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Randomized Algorithms + Approximation Algorithms + Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Price for all three: $196.22

Buy the selected items together

NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Hardcover: 496 pages
  • Publisher: Cambridge University Press; 1ST edition (August 25, 1995)
  • Language: English
  • ISBN-10: 0521474655
  • ISBN-13: 978-0521474658
  • Product Dimensions: 7 x 1.1 x 10 inches
  • Shipping Weight: 2.2 pounds (View shipping rates and policies)
  • Average Customer Review: 3.9 out of 5 stars  See all reviews (8 customer reviews)
  • Amazon Best Sellers Rank: #770,288 in Books (See Top 100 in Books)

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

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.

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

3.9 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

39 of 44 people found the following review helpful By Philippe FLAJOLET on January 13, 2002
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
19 of 22 people found the following review helpful By Johnny Wong on October 15, 1999
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
14 of 20 people found the following review helpful By Two Cats on November 1, 2004
Format: Hardcover
Overall, the authors explain core concepts, the examples and the possible applications well. However, the readibility of their proof is far from that of the above three. Honestly some proofs should be re-written completely.

For example, in page 116, they try to use the induction method to prove Lova(')sz Local Lemma. After reading that page many times, I still didn't understand the structure of their proof.

I was TA for under-grad level algorithm course, got A+ in advanced Calculus II and A in intro. to PDE (both in under-grad level), really knew something about induction method and a little bit about algorithm. I am not smart, but far from stupid.

In the end, I google the internet and found a 3-page proof for the same thing. That's easy to catch in few minutes, and then, I understand the 1-page proof in the book. Is it ironic?
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
8 of 11 people found the following review helpful By Gonen Benjamin on July 20, 2001
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?