Concentration of Measure for the Analysis of Randomized Algorithms
- List Price$44.00
- Your price$37.39
Save $6.61 (15% off) and earn Kobo Super Points!
You'll see how many points you'll earn before checking out. We'll award them after completing your purchase.
Or, get it for 18400 Kobo Super Points!
See if you have enough points for this eBook. Sign in
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.
- Cambridge University Press, June 2009
Cambridge University Press
- Download options:
- EPUB 2 (Adobe DRM)
You can read this item using any of the following Kobo apps and devices: