Devdatt P. Dubhashi, Alessandro Panconesi (Eds.), Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, UK (2009). ISBN: 978-0-521-88427-3

摘要

I believe that the book Concentration of Measure for the Analysis of Randomized Algorithms is a handy book to have around, especially by researchers working in algorithmics and discrete mathematics. The book is written by two people with a lot of expertise and experience in the topic. As the authors say, the book aims to be a "cook-book" to supply recipes to do formal analysis of concentration bounds under different conditions of the random variables. In that sense, through Chapter 8 and also a bit Chapter 11, the objective is accomplished.