Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book pres

This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book pres

Describes the interplay between the probabilistic structure (independence) and a variety of tools ranging from functional inequalities to transportation argumen

This book presents basic tools from probability theory used in algorithmic applications, with concrete examples.