Computer Science 671:
Randomized Algorithms (4.0 units)
Standard techniques in the design and analysis of randomized algorithms and random structures. Topics include tail bounds, Markov Chains, VC-dimension, probabilistic method. Prerequisite: CSCI 570 or CSCI 670. Recommended preparation: Basic background in probability and linear algebra.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29972D | 048 | Lecture | 10:00-11:50am | Mon, Wed | 16 of 25 | David Kempe | KAP141 |   |