Instructor: Bo Waggoner
COVID-19 announcement: We plan to make the class accessible for students in as many situations and time zones as possible. Expect asynchronous, recorded lectures and reading assignments, along with synchronous problem-solving sessions at the scheduled class time.
This graduate-level course will survey a variety of approaches to designing and rigorously analyzing efficient algorithms. Topics include: combinatorial and graph algorithms; randomized, online, and approximation algorithms; and continuous convex or linear-algebra based methods.
There will be no required textbook (readings will be posted or linked).
More information will be posted as the semester approaches. The course will closely follow last year's offering.