DeepRead
Cover of Randomized algorithms

Randomized algorithms

Rajeev Motwani · 1995

Programming and computer science › Algorithms and coding interviews

#5,620 most recommended

About the book

A graduate-level textbook on randomized algorithms, co-written with Prabhakar Raghavan. It covers algorithms that make random choices during execution, and the probability theory needed to analyze them. Its scope includes data structures, graph and geometric algorithms, approximate counting, and Markov chain methods. The book's central claim is that randomness is a practical resource in algorithm design, often producing simpler or faster solutions than the best known deterministic methods. It distinguishes Las Vegas algorithms, which always return correct answers with random running time, from Monte Carlo algorithms, which run in bounded time but may err with small probability. It presents a small set of recurring analytical tools, such as linearity of expectation, Chernoff bounds, and the probabilistic method, and shows how they yield expected or high-probability guarantees.

Written by Claude from what it knows of this book.

What Hacker News says 57% recommend · 0% critical

02420102015202020232010 peak · 3
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1995
ISBN
9780521474658
Editions known
8 at Open Library
Open Library
OL3522565W

AlgorithmsData processingStochastic processes

Explore in the mosaic

Read next: its neighbours on the mosaic