Randomized Algorithms

  1. Syllabus
  2. PDF

  3. Office Hours:
  4. By appointment

  5. Selected Lecture Notes

  6. Notes Date
    Rudiments January 17, January 19
    Expectation January 19, January 24
    Variance January 26
    A sampling of randomized algorithms January 31, February 2
    Randomized Quicksort February 7
    Moments and Deviations February 9
    Chernoff Bounds (Fundamentals) February 14
    Cheroff Bounds (Applications) February 16
    The LazySelect Algorithm February 21, February 23
    Balls and Bins (Preliminaries) February 28, March 1
    Balls and Bins (Advanced)) March 6, March 8
    Markov Chains (Preliminaries) March 13, March 15
    Markov Chains (Advanced) March 20, March 22
    The Monte Carlo Method (Introduction) April 5
    The Monte Carlo Method (Advanced) April 10
    Martingales (Introduction) April 17
    The Probabilistic Method April 24
    Martingales (Advanced) April 28
    The Lovasz Local Lemma April 28

  7. Quizzes, Exams and Notes

  8. Notes Date
    Course Overview January 17
    Homework I January 26
    Scrimmage I January 26
    Homework II March 1
    Scrimmage II March 15
    Homework III April 3