Best of
Algorithms
2005
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher - 2005
It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.