This course will serve as an introduction to randomized algorithms and to probabilistic analysis of algorithms. The course introduces probabilisitic tools and techniques (which should be in the arsenal of every computer science grad student) and presents applications of randomized algorithms and probabilistic analysis techniques in areas such as combinatorial optimization, data structures, graph algorithmics, communication, networking, parallel and distributed computation, computational biology/bioinformatics and more.

Homepage	http://www.cs.purdue.edu/homes/gopal/cs590-2005
Usually Offered:	Fall
Credit:	3 hours (class)
Prerequisite:	At least an undergraduate course in algorithms or consent of the instructor
University Catalog:	CS 590R
Schedule:	Fall 2005 Instructor: Gopal Pandurangan