Computer Science 599.01 / 601.03 - Randomized Algorithms

Winter 2010 - Philipp Woelfel

Contents

Course Summary
Textbooks
Requirements
Lectures
Contact
Office Hours

Course Summary

In this course we study algorithms that make random choices as they proceed. Over the last decades, such randomized (or probabilistic) algorithms have found widespread application in essentially all areas of computing, and randomization has become one of the most powerful tools in algorithm design. For many applications we know randomized algorithms that are simpler or more efficient (or both) than any known deterministic algorithms.

This course will explore techniques for designing and analyzing randomized algorithms, and will provide examples from a variety of problem areas. Topics include
Basic knowledge in probability theory is required (e.g., the notion of random variables, expectation, independence, etc.). More advanced material will be introduced whenever necessary.

Textbooks

Requirements

Lectures

Time: Mondays and Wednesdays, 16:00-17:15.
Location: MS 319

Contact

See my homepage.

Office Hours

Mondays and Wednesdays, 17:15-18:00 (ICT 655), or by appointment.
Please approach me right after class if you want to meet me during my regular office hours.