CS 574

Spring 2014 Part of Term 1

Part of Term 1
Jan 21-May 7

Randomized Algorithms

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.

Prerequisite: CS 473; MATH 461 or STAT 400.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 574 class schedule data for spring 2014
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	60442	Lecture	RA	2:00PM -3:15PM	TR	Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 01/21/14-05/07/14 Credit: 4 hours