Lecture 23: Examples

December 1st, 2008

We went through a series of examples of randomization.

  1. Randomized median finding: how to apply randomization to divide and conquer
  2. Randomized MAX 3SAT: The probabilistic method, and designing an approximation algorithm that uses randomness
  3. The Birthday Paradox: we analyzed the well known phenomenon, and connected it to a problem in hashing (how many items do you need to guarantee a collision in n buckets).

The first two topics were taken from the textbook, and the last topic is covered in the linked notes.

Leave a Reply