Probability Theory, Mathematical Analysis - General & Miscellaneous, Mathematical Programming & Operations Research
Log in to track your reading progress.
Overview
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.Synopsis
An excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses.
Editorials
From the Publisher
"Mitzenmacher and Upfal have written an excellent introductory textbook on the role of randomness in algorithms and computer simulation. I would recommend it to anyone looking for a fresh approach to the basics of probability."Max Buot, Carnegie Mellon University, Journal of the American Statistical Association
"The exposition is clear and the development carefully paced and well motivated."
Mark R. Jerrum, Mathematical Reviews
Book Details
Published
December 1, 2004
Publisher
Cambridge University Press
Pages
352
Format
Hardcover
ISBN
9780521835404