CS 574
Spring 2024 All Classes
All Classes
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.
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.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
60442
|
Lecture
|
RA
|
3:30PM
-4:45PM
|
TR
|
1304 Siebel Center for Comp Sci
|
Har-Peled, S
|
|