Course Websites

CS 574 - Randomized Algorithms

Last offered Fall 2025

Official Description

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: One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400.

Related Faculty

Chandra Sekhar Chekuri

Web Page

https://courses.grainger.illinois.edu/cs574/fa2025/

Title	Section	CRN	Type	Hours	Times	Days	Location	Instructor
Randomized Algorithms	R	65259	LCD	4	0930 - 1045	W F	0216 Siebel Center for Comp Sci	Chandra Chekuri