CS 574
spring 2021
All Classes
Randomized Algorithms
Credit: 4 hours.
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.
- Section Status Closed
- Section Status Open
- Section Status Pending
- Section Status Open (Restricted)
- Section Status Unknown
Section Status updates every 10 minutes.
| Detail | Status | CRN | Type | Section | Time | Day | Location | Instructor |
|---|