Some notes for Randomized Algorithms, LNMB, 2019.

Nikhil Bansal and  Rene Sitters

 

Lecture 1:  Introduction and Overview
Lecture 2: Linearity of Expectation
Lecture 3: Learning from Expert advice, fingerprinting
Lecture 4: Estimation, median of means, Streaming
Lecture 5: k-wise independence, Chernoff bounds

 

Exercise 1 (due March 18)  Mail solutions to Nikhil Bansal (email:  n dot lastname at tue dot nl)
Exercise 2 (due April 1)  Mail solutions to Nikhil Bansal (email:  n dot lastname at tue dot nl)

 

Similar courses on the web (with lots of interesting links)

UC Berkeley (Luca Trevisan)
UBC (Nick Harvey)
CMU (Anupam Gupta and Shuchi Chawla)
UW (James Lee)