CS 574
CS 574 - Randomized Algorithms
Spring 2021
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Randomized Algorithms | CS574 | RA | 60442 | ONL | 4 | 0930 - 1045 | M W | Timothy Moon-Yew Chan |
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: CS 473; MATH 461 or STAT 400.