CS 574
Fall 2015 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.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
65259
|
Lecture-Discussion
|
R
|
12:30PM
-1:45PM
|
TR
|
1105 Siebel Center for Comp Sci
|
Kolla, A
|
|