CS 574 - Randomized Algorithms
Last offered Spring 2022
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||LEC||4||1530 - 1645||T R||1304 Siebel Center for Comp Sci||Sariel Har-Peled|