Notes on Randomized Algorithms By James Aspnes PDF

Share this:

Download Notes on Randomized Algorithms By James Aspnes PDF book free online – From Notes on Randomized Algorithms By James Aspnes PDF: For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of 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 Lovasz 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.

About the Authors

  • James Aspnes is a professor in the Computer Science Department at Yale. He is also the Director of Undergraduate Studies for the Computer Science department. His main area of research is distributed algorithms.
Share this: