Skip to content
Register Sign in Wishlist

Concentration of Measure for the Analysis of Randomized Algorithms

$144.00 (C)

  • Date Published: June 2009
  • availability: Available
  • format: Hardback
  • isbn: 9780521884273

$ 144.00 (C)

Add to cart Add to wishlist

Other available formats:
Paperback, eBook

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.

    • Exposition throughout is in discrete settings with elementary probability avoiding measure theory
    • Comparative study of the range of techniques highlighting their relative strengths and weaknesses by applications to the same concrete problems
    • Many examples from computer science settings such as distributed algorithms, web graph analysis, approximation algorithms
    Read more

    Reviews & endorsements

    Pre-Publication Review: "Concentration bounds are at the core of probabilistic analysis of algorithms. This excellent text provides a comprehensive treatment of this important subject, ranging from the very basic to the more advance tools, including some recent developments in this area. The presentation is clear and includes numerous examples, demonstrating applications of the bounds in analysis of algorithms. This book is a valuable resource for both researches and students in the field."
    Eli Upfal, Professor of Computer Science, Brown University, author of "Probability and Computing"

    "It is beautifully written, contains all the major concentration results, and is a must to have on your desk."
    Rich Lipton

    "The book does a superb job of describing a collection of powerful methodologies in a unified manner; what is even more striking is that basic combinatorial and probabilistic language is used in bringing out the power of such approaches. To summarize, the book has done a great job of synthesizing diverse and important material in a very accessible manner. Any student, researcher, or practitioner of computer science, electrical engineering, mathematics, operations research, and related fields, could benefit from this wonderful book. The book would also make for fruitful classes at the undergraduate- and graduate- levels. I highly recommend it."
    Aravind Srinivasan, SIGACT News

    "The strength of this book is that it is appropriate for both the beginner as well as the experienced researcher in the field of randomized algorithms. I highly recommend this book both as an advanced as well as an introductory textbook, which can also serve the needs of an experienced researcher in algorithmics."
    Yannis C. Stamatiou, Mathematical Reviews

    "This timely book brings together in a comprehensive and accessible form a sophisticated toolkit of powerful techniques for the analysis of randomized algorithms, illustrating their use with a wide array of insightful examples. This book is an invaluable resource for people venturing into this exciting field of contemporary computer science research."
    Prabhakar Ragahavan, Yahoo Research

    "Concentration inequalities are an essential tool for the analysis of algorithms in any probabilistic setting. There have been many recent developments on this subject, and this excellent text brings them together in a highly accessible form."
    Alan Frieze, Carnegie Mellon University

    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 2009
    • format: Hardback
    • isbn: 9780521884273
    • length: 214 pages
    • dimensions: 229 x 152 x 16 mm
    • weight: 0.49kg
    • contains: 12 b/w illus. 168 exercises
    • availability: Available
  • Table of Contents

    1. Chernoff–Hoeffding bounds
    2. Applying the CH-bounds
    3. CH-bounds with dependencies
    4. Interlude: probabilistic recurrences
    5. Martingales and the MOBD
    6. The MOBD in action
    7. Averaged bounded difference
    8. The method of bounded variances
    9. Interlude: the infamous upper tail
    10. Isoperimetric inequalities and concentration
    11. Talagrand inequality
    12. Transportation cost and concentration
    13. Transportation cost and Talagrand's inequality
    14. Log–Sobolev inequalities
    Appendix A. Summary of the most useful bounds.

  • Instructors have used or reviewed this title for the following courses

    • Randomized Algorithms
  • Authors

    Devdatt P. Dubhashi, Chalmers University of Technology, Gothenberg
    Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.

    Alessandro Panconesi, Università degli Studi di Roma 'La Sapienza', Italy
    Alessandro Panconesi is Professor of Computer Science at Sapienza University of Rome. He earned a Ph.D. in computer science from Cornell University and is the recipient of the 1992 ACM Danny Lewin Award. Panconesi has published more than 50 papers in international journals and selective conference proceedings and he is the associate editor of the Journal of Discrete Algorithms and the director of BiCi, the Bertinoro International Center of Informatics. His research spans areas of algorithmic research as diverse as randomized algorithms, distributed computing, complexity theory, experimental algorithmics, wireless networking and Web information retrieval.

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

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.


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.