Course syllabus:

Probabilistic methods in Combinatorics and their
applications in theoretical Computer Science. The topics include
linearity of expectation, the second moment method, the local
lemma, correlation inequalities, martingales, large deviation
inequalities, geometry, derandomization.