Derandomization

• The Probabilistic Method and Randomized Algorithms: From Tail Bounds to Derandomization · 2025-05-30

  Master the probabilistic method — Paul Erdős's beautiful technique for proving existence non-constructively — alongside the tail bounds (Chernoff, Hoeffding, Azuma) that make randomized algorithms practical, and the modern methods for removing randomness.