Basic Information

Instructor: Kamesh Munagala

Course Format: Given the prevailing virus caseloads and the large class size, the course will run entirely online.

There will be:

• Two hours of asynchronously recorded lectures per week

• One "discussion and problem solving" meeting Thursdays 12:00 - 1:15pm

TA: Kangning Wang

Synopsis

This course will cover algorithm design techniques at a graduate level. Topics include the mainstays of modern algorithmic thinking: Mathematical programming, Approximation algorithms, Hashing, and Algebraic methods.

Textbooks

I will mainly use material from these sources. Buying the books is optional. I have put pointers to easy-to-digest notes.

[KT] Algorithm Design by Jon Kleinberg and Eva Tardos.

[CLRS] Introduction to Algorithms by T. Cormen, C. Leiserson, R. Rivest, and C. Stein.

[DPV] Algorithms by S. Dasgupta, C. Papadimitriou, and U. Vazirani.

Other Material

Slides from the [KT] book are available online.

Course notes from CS261 at Stanford (courtesy Serge Plotkin).