CS 59200: Analytical Toolkit in Computer Science (Spring 2022)

Schedule:
  • Time: Tuesday and Thursday (12:00 pm - 01:15 pm)
  • Location: University Hall 117
Instructor:
Campuswire Link:
    link (4-digit code is available on brightspace)
Teaching Assistant:

Course Outline and Policy: [html]
Key Emergency Preparedness Resources: [html]

Lectures:
A Tentative List of Topics:
  • Basics
    • Inequalities: Lagrange form of the Taylor's Remainder Theorem, Jensen's Inequality and consequences
    • Summations/Integrals
    • Stirling's Approximation
    • Probability Basics, Pigeonhole Principle
  • Balls and Bins Problems
    • Birthday Bound, Max-Load, Coupon Collectors' Problem, Poisson Approximation Theorem
    • The Power of 2 Choices
    • Bloom Filters
    • Randomized Routing on Networks
  • Concentration Inequalities
    • Markov Inequality, Chebyshev Inequality
    • Chernoff-Hoeffding Bound
    • Martingales, Filtration, and Azuma's Inequality
    • Talagrand Inequality
  • Probabilistic Techniques
    • Lovász Local Lemma and a few Applications
    • Generalized Lovász Local Lemma
    • Moser-Tardos Algorithm
  • Discrete Fourier Analysis
    • Basics
    • BLR Linearity Testing
    • Randomness Extraction and Left-over Hash Lemma
    • Hypercontractivity
    • KKL Theorem
    • Pseudorandomness and Goldreich-Levin Theorem

Previously Offered:

CS 59000 MTK (Spring 2019)
CS 59000 MTK (Spring 2018)
CS 59000 MTK (Spring 2017)
CS 59000 MTK (Spring 2016)


Useful Materials: Representative Course Material