CS 574 - Randomized Algorithms
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.
|Randomized Algorithms||RA||60442||ONL||4||1230 - 1345||M W||Timothy Moon-Yew Chan|