Class Meetings
Lectures: Tue, Thu 11-12:15, MCS-B23

Instructor: Peter Gács
Office Hours: Tue 3-4:30, Fri 10:15-11:45 or by appointment.
Coordinates:, MCS-277, 617-353-2015

Required: Recommended: To refresh your background, a good introduction to probability is

General description
Prerequisites: an undergraduate course on elementary probability, an undergraduate course on the analysis of algorithms.

Randomness is used in several important ways in the design of efficient algorithms, in the analysis of (even nonrandomized) algorithms and in the theory of computing. The course will make you acquainted with the most important probabilistic techniques and reasoning methods, and also the most important types of (practical and theoretical) application.
For planned topics, look at the tentative schedule.