Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Probability and Computing
Randomization and Probabilistic Techniques in Algorithms and Data Analysis

2nd Edition

$69.99 (X)

textbook
  • Date Published: July 2017
  • availability: In stock
  • format: Hardback
  • isbn: 9781107154889

$ 69.99 (X)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Request examination copy

Instructors may request a copy of this title for examination

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.

    • Contains all the background in probability needed to understand many subdisciplines of computer science
    • Includes new material relevant to machine learning and big data analysis, enabling students to learn new, up-to-date techniques and applications
    • Newly added chapters and sections cover the normal distribution, sample complexity, VC dimension, naïve Bayes, cuckoo hashing, power laws, and the Lovasz Local Lemma
    • Many new exercises and examples, including several new programming-related exercises, provide students with excellent training in problem solving
    Read more

    Reviews & endorsements

    'As randomized methods continue to grow in importance, this textbook provides a rigorous yet accessible introduction to fundamental concepts that need to be widely known. The new chapters in this second edition, about sample size and power laws, make it especially valuable for today's applications.' Donald E. Knuth, Stanford University

    'Of all the courses I have taught at Berkeley, my favorite is the one based on the Mitzenmacher-Upfal book Probability and Computing. Students appreciate the clarity and crispness of the arguments and the relevance of the material to the study of algorithms. The new Second Edition adds much important material on continuous random variables, entropy, randomness and information, advanced data structures and topics of current interest related to machine learning and the analysis of large data sets.' Richard M. Karp, University of California, Berkeley

    'The new edition is great. I’m especially excited that the authors have added sections on the normal distribution, learning theory and power laws. This is just what the doctor ordered or, more precisely, what teachers such as myself ordered!' Anna Karlin, University of Washington

    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

    • Edition: 2nd Edition
    • Date Published: July 2017
    • format: Hardback
    • isbn: 9781107154889
    • length: 484 pages
    • dimensions: 260 x 182 x 25 mm
    • weight: 1.15kg
    • contains: 8 b/w illus. 1 table
    • availability: In stock
  • Table of Contents

    1. Events and probability
    2. Discrete random variables and expectations
    3. Moments and deviations
    4. Chernoff and Hoeffding bounds
    5. Balls, bins, and random graphs
    6. The probabilistic method
    7. Markov chains and random walks
    8. Continuous distributions and the Polsson process
    9. The normal distribution
    10. Entropy, randomness, and information
    11. The Monte Carlo method
    12. Coupling of Markov chains
    13. Martingales
    14. Sample complexity, VC dimension, and Rademacher complexity
    15. Pairwise independence and universal hash functions
    16. Power laws and related distributions
    17. Balanced allocations and cuckoo hashing.

  • Authors

    Michael Mitzenmacher, Harvard University, Massachusetts
    Michael Mitzenmacher is a Professor of Computer Science in the School of Engineering and Applied Sciences at Harvard University, Massachusetts. Professor Mitzenmacher has authored or co-authored over 200 conference and journal publications on a variety of topics, including algorithms for the internet, efficient hash-based data structures, erasure and error-correcting codes, power laws, and compression. His work on low-density parity-check codes shared the 2002 IEEE Information Theory Society Best Paper Award and won the 2009 ACM SIGCOMM Test of Time Award. He was elected as the Chair of the ACM Special Interest Group on Algorithms and Computation Theory in 2015.

    Eli Upfal, Brown University, Rhode Island
    Eli Upfal is a Professor of Computer Science at Brown University, where he was also the department chair from 2002 to 2007. Prior to joining Brown in 1998, he was a researcher and project manager at the IBM Almaden Research Center, and a professor at the Weizmann Institute of Science, Israel. His main research interests are randomized algorithms, probabilistic analysis of algorithms, and computational statistics, with applications ranging from combinatorial and stochastic optimization, massive data analysis and sampling complexity to computational biology, and computational finance.

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

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