DeepRead
Cover of Probability and Computing

About the book

A graduate-level textbook, co-written by Michael Mitzenmacher and Eli Upfal, on probability theory as used in computer science. It covers discrete probability, expectation, concentration bounds such as Chernoff bounds, balls-and-bins models, Markov chains, the probabilistic method, and martingales, with randomized algorithms and their analysis as the main applications. Randomness is a practical tool for designing simple, fast algorithms and for analysing systems, and the probabilistic method can prove the existence of structures that are hard to construct directly. The text holds that a small set of recurring techniques, mainly linearity of expectation, tail bounds, and Markov chain analysis, covers most of the reasoning needed. It teaches these techniques through worked examples from hashing, load balancing, sampling, and randomized search.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

01220112015202020252020 peak · 2
This bookAverage book in Bayesian and probabilistic modeling

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 4 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

The threads it came up in

Details

First published
2005
ISBN
9780521835404
Editions known
10 at Open Library
Open Library
OL16951595W

518/.1AlgorithmentheorieAlgorithmsProbabilitiesQa274 .m574 2005Stochastic analysisStochastische AnalysisWahrscheinlichkeitstheorie

Explore in the mosaic

Read next: its neighbours on the mosaic