Department of Computer Sciences @ Purdue University
Search | General Information | Academics | Research | People | External Relations

CS 590R Randomized Algorithms and Probabilistic Techniques in Computer Science

Probabilistic techniques, in general, and randomized algorithms, in particular, play an increasingly important role in a variety of computer science applications ranging from cryptography and communication networks to Web search engines, AI reasoning, data mining, and bioinformatics. This course will serve as an introduction to probability theory in computer science, in particular to randomized algorithms and to probabilistic analysis of algorithms. The course introduces basic probability theory and presents applications of randomized algorithms and probabilistic analysis techniques in areas such as combinatorial optimization, data structures, graph algorithmics, communication, parallel computation, cryptography, biology and more. Assumes no prior knowledge of probability theory. The course website is http://www.cs.purdue.edu/homes/gopal/cs590-2004/

Usually Offered: Spring
Credit: 3 hours (class)
Prerequisite: At least an undergraduate course in algorithms or consent of the instructor
University Catalog: CS 590R
Schedule: Spring 2004
Instructor: Gopal Pandurangan