CSE 525
Randomized Algorithms and Probabilistic Analysis
Examines algorithmic techniques: random selection, random sampling, backwards analysis, algebraic methods, Monte Carlo methods, and randomized rounding; random graphs; the probabilistic method; Markov chains and random walks; and analysis tools: random variables, moments and deviations, Chernoff bounds, martingales, and balls in bins. Prerequisite: either CSE 521 or equivalent.
Sources
- Course catalogue ↗Current public catalogue; retrieved 2026-11-05