Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Concentration of Measure for the Analysis of Randomized Algorithms
  • Cited by 363
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      October 2009
      June 2009
      ISBN:
      9780511581274
      9780521884273
      9781107606609
      DOI:
      https://doi.org/10.1017/CBO9780511581274
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.45kg, 214 Pages
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.32kg, 214 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science
    Information

    Book description

    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 toolkit from the Chernoff–Hoeffding 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 Chernoff–Hoeffding bounds in dependent settings. The authors emphasise 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.

    Reviews

    Review of the hardback:‘It is beautifully written, contains all the major concentration results, and is a must to have on your desk.'

    Richard Lipton

    Review of the hardback:‘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 advanced 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 researchers and students in the field.'

    Eli Upfal - Brown University

    Review of the hardback:‘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

    Review of the hardback:‘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 Source: SIGACT News

    Review of the hardback:‘… 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 … The exposition style […] combines informal discussion with formal definitions and proofs, giving first the intuition and motivation for the probabalistic technique at hand. … 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 Source: Mathematical Reviews

    Reviews of the hardback:‘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

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.