Skip to content
Register Sign in Wishlist

Probability and Computing
Randomized Algorithms and Probabilistic Analysis

$75.00 USD

textbook
  • Date Published: June 2013
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9780511108822

$ 75.00 USD
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communication networks and secure protocols. This 2005 textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It assumes only an elementary background in discrete mathematics and gives a rigorous yet accessible treatment of the material, with numerous examples and applications. The first half of the book covers core material, including random sampling, expectations, Markov's inequality, Chevyshev's inequality, Chernoff bounds, the probabilistic method and Markov chains. The second half covers more advanced topics such as continuous probability, applications of limited independence, entropy, Markov chain Monte Carlo methods and balanced allocations. With its comprehensive selection of topics, along with many examples and exercises, this book is an indispensable teaching tool.

    • 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

    '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, Professor of Computer Science, University of California, Berkeley

    'This book is suitable as a text 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, Professor of Computer Science, University of Victoria, British Columbia

    'Buy it, read it, enjoy it; profit from it. it feels as if it has been well tested out of students and will work straight away.' Colin Cooper, Department of computer Science, 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, professor of Mathematics, Carnegie-Mellon University

    ' … very well written and contains useful material on probability theory and its application in computer science.' Zentralblatt MATH

    ' … this book offers a very good introduction to randomised algorithms and probabilistic analysis, both for the lecturer and independent reader alike. it is also a good book for those wanting practical examples that can be applied to real world problems.' Mathematics Today

    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: June 2013
    • format: Adobe eBook Reader
    • isbn: 9780511108822
    • contains: 50 b/w illus. 80 exercises
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    Preface
    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
    References.

  • 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

Cancel

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 lecturers@cambridge.org

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 www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.
×