CS 574
CS 574 - Randomized Algorithms
Spring 2024
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Randomized Algorithms | CS574 | RA | 60442 | LEC | 4 | 1530 - 1645 | T R | 1304 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: 4 graduate hours. No professional credit. Prerequisite: One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400.