Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Name: Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Rating: 4.0 (4 reviews)
Author: Michael Mitzenmacher
ISBN: 9780521835404

Author: Michael Mitzenmacher Author: Eli Upfal

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales…

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. 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.

Buy this book

Amazon.com Read in Kindle Read in Google Play

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Genres

Shelves