Lecture notes for the Yale Computer Science course CPSC 469/569 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from probability theory, including random variables and expectations, union bound arguments, concentration bounds, applications of martingales and Markov chains, and the Lovász Local Lemma. Algorithmic topics include analysis of classic randomized algorithms such as Quicksort and Hoare's FIND, randomized tree data structures, hashing, Markov chain Monte Carlo sampling, randomized approximate counting, derandomization, quantum computing, and some examples of randomized distributed algorithms.
This open book is licensed under a Creative Commons License (CC BY-SA). You can download Notes on Randomized Algorithms ebook for free in PDF format (3.3 MB).
Table of Contents
Basic probabilistic inequalities
Randomized search trees
Martingales and stopping times
The probabilistic method
Randomized distributed algorithms