E0 234: Randomized Algorithms, Spring 2016.

Instructors: Arnab Bhattacharyya and Deeparnab Chakrabarty
TA: Palash Dey.
Venue: CSA 254.
Times: Mondays and Wednesdays, 2 - 3:30 pm

Course Description
The use of randomness in algorithm design is an extremely powerful paradigm. In this course, we will introduce the basic techniques of designing randomized algorithms although at times we will dive into state-of-the-art topics. Students are expected to have taken an introductory course in algorithm design and analysis, and some familiarity with probability, although not essential, is desirable.

We will be using Piazza for this class. If you are an enrolled student, please sign yourself up at this link; you could miss important announcements otherwise.

Recommended Books

Problem Sets (email solutions to e0234iisc@gmail.com by due date)