Skip to content

Your Cart


You have 0 items in your cart.

Register Sign in Wishlist
Probability and Computing

Probability and Computing
Randomized Algorithms and Probabilistic Analysis

$84.99 (X)

  • Date Published: January 2005
  • availability: Available
  • format: Hardback
  • isbn: 9780521835404

$ 84.99 (X)

Add to cart Add to wishlist

Other available formats:

Request examination copy

Instructors may request a copy of this title for examination

Product filter button
About the Authors
  • 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.

    • Contains needed background material to understand many subdisciplines of computer science
    • Many examples and exercises
    • Provides introduction to both core subject matter and advanced topics
    Read more

    Reviews & endorsements

    "An excellent book which sets off straight away in Chapter 1 with interesting motivational examples, striking the right balance between theory and application. Having both breadth and depth it is accessible and interesting to both undergraduate and graduate students. It takes the reader all the way from introductory to advanced topics and leaves them empowered with the tools to continue research on their own...It's obviously written by people who understand the subject inside out and how to explain it to students. Buy it, read it enjoy it; profit from it. It feels as if it has been well tested out on students and will work straight away."
    Colin Cooper, King's College, University of London

    "An exciting new book on randomized algorithms. It nicely covers all the basics, and also has some interesting modern applications for the more advanced student."
    Alan Frieze, Carnegie-Mellon University

    "This text provides a solid background in probabilistic techniques, illustrating each with well-chosen examples. The explanations are clear, and convey the intuition behind the results and techniques, yet the coverage is rigorous. An excellent advanced undergraduate text."
    Peter Bartlett, University of California, Berkeley

    "Probability is part of the conceptual core of modern computer science. Probabilistic analysis of algorithms, randomized algorithms and probabilistic combinatorial constructions have become fundamental tools for computer science and applied mathematics. This book provides a thorough grounding in discrete probability and its applications in computing,at a level accessible to advanced undergraduates in the computational, mathematical and engineering sciences."
    Richard M. Karp, University of California, Berkeley

    "This text presents a clear exposition of the tools of probabilistic analysis from the very basics to more advanced topics. In addition, each chapter offers a well-chosen set of problems for a range of abilities. This book is suitable for upper division undergraduates and first year graduate students in computer science and related disciplines. It will also be useful as a reference for researchers who would like to incorporate these tools into their work. I enjoyed teaching from the book and highly recommend it."
    Valerie King, University of Victoria

    "The structure and pace of this book are well matched to the intended audience. The authors consistently maintain a good balance between theory and applications...Good students will be challenged and yet average students will find the text very readable. This is a very attractive textbook."
    MAA, Bill Satzer

    "The book can be used for self-study since there are exercises in each chapter."
    Mathematics of Computation

    “Because of the widespread interest in the subject, a textbook covering randomization in computer science must…be many things to many different people: it should serve as an introduction to the area for an undergraduate or graduate student interested in randomized algorithms; a survey of applications and techniques for the general computer scientist; and also a solid reference for the advanced researcher. I am pleased to say that Probability and Computing…succeeds on all these fronts. I found the book a joy to read: the writing is clear and concise, the proofs are well-structured, and the writing style invites the reader to explore the material. The book is also organized very well, and the selection of topics is excellent. I have already used the book multiple times as a reference, and have found it incredibly useful each time.”
    Jonathan Katz, Department of Computer Science, University of Maryland for SIGACT News

    "...this book is an authoritative and up-to-date reference on the implementation of the simplex method. For the audience of readers who are interested in implementing the simplex method it is a 'must read.'"
    Brian Borchers, University of Maryland at College Park, MD

    "A well conceived textbook... It is an attractive feature of the book that many concepts are motivated by examples and illustrated with probabilistic algorithms from computer science..."
    Harald Niederreiter for Mathematics of Computation

    "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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2005
    • format: Hardback
    • isbn: 9780521835404
    • length: 370 pages
    • dimensions: 259 x 185 x 25 mm
    • weight: 0.86kg
    • contains: 50 b/w illus. 80 exercises
    • availability: Available
  • Table of Contents

    1. Events and probability
    2. Discrete random variables and expectation
    3. Moments and deviations
    4. Chernoff bounds
    5. Balls, bins and random graphs
    6. The probabilistic method
    7. Markov chains and random walks
    8. Continuous distributions and the Poisson process
    9. Entropy, randomness and information
    10. The Monte Carlo method
    11. Coupling of Markov chains
    12. Martingales
    13. Pairwise independence and universal hash functions
    14. Balanced allocations

  • Authors

    Michael Mitzenmacher, Harvard University, Massachusetts
    Michael Miztenmacher is a John L. Loeb Associate Professor in Computer Science at Harvard University. Having written nearly 100 articles on a variety of topics in computer science, his research focuses on randomized algorithms and networks. He has received an NSF CAREER Award and an Alfred P. Sloan Research Fellowship. In 2002, he shared the IEEE Information Theory Society Best Paper Award for his work on error-correcting codes.

    Eli Upfal, Brown University, Rhode Island
    Eli Upfal is Professor and Chair of Computer Science at Brown University. He has published more than 100 papers in refereed journals and professional conferences, and is the inventor of more than ten patents. His main research interests are randomized computation and probabilistic analysis of algorithms, with applications to optimization algorithms, communication networks, parallel and distributed computing and computational biology.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.