CS 574
CS 574 - Randomized Algorithms
Fall 2026
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Randomized Algorithms | CS574 | R | 65259 | LCD | 4 | 0930 - 1045 | W F | 1214 Siebel Center for Comp Sci | Sariel Har-Peled |
See full schedule from Course Explorer
Official Description
Basic and advanced concepts in the design and analysis of randomized algorithms. Sampling; concentration inequalities such as Chernoff-Hoeffding bounds; probabilistic method; random walks, dimension reduction; entropy; martingales and Azuma's inequality; derandomization. Randomized algorithms for sorting and searching; graphs; geometric problems. Basics of pseudorandomness and randomized complexity classes. Course Information: Prerequisite: One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400.