Spring 2021
Tuesdays and Thursdays, 3:00PM to 4:15 PM
Lectures and office hours are on Zoom at purdue-edu.zoom.us/j/93829189665
Staff | (email) | (office hours) |
Kent Quanrud | krq (at) purdue.edu | Tuesday and Thursday 4:15 - 5:15 PM |
Himanshi Mehta | mehta142 (at) purdue.edu | Wednesday 1:00 - 2:00 PM |
Xiaowei Zhang | zhan2597 (at) purdue.edu | Monday 4:30 - 5:30 PM |
Previous edition of this course.
Kent Quanrud, Spring 2020.
Algorithm design, analysis, and implementation.
Jeremiah Blocki.
Algorithm design, analysis, and implementation.
Elena Grigorescu.
Introduction to algorithms.
Srini Devadas and Erik Demaine (MIT).
Algorithms and models of computation.
Jeff Erickson (UIUC).
Efficient algorithms and intractable problems.
Prasad Raghavendra and Satish Rao (Berkeley).
Advanced Algorithms.
Jelani Nelson (Harvard).
Algorithms.
Danny Sleator and Carl Kingsford (CMU).
Algorithms.
Avrim Blum and Anupam Gupta (CMU).
Fundamental algorithms.
Chandra Chekuri (UIUC).
Advanced algorithms.
David Karger and Aleksander Madry (MIT).
A course in combinatorial optimization.
Alexander Schrijver (CWI).
Advanced algorithms.
Ankur Moitra (MIT).
Advanced algorithm design.
Sanjeev Arora (Princeton).
A second course in algorithms.
Tim Roughgarden (Stanford).
Lecture notes will be provided. The following texts are also very helpful.
Algorithms, by Erickson ("Jeff's notes")
Algorithm design, by Kleinberg and Tardos ("KT")
Algorithms, by Dasgupta, Papadimitriou, and Vazirani ("DPV")
Introduction to algorithms, by Cormen, Leiserson, Rivest, and Stein ("CLRS")
Midterm 1: February 16 (multiple choice) and 18 (word problems)
Midterm 2: March 30 (multiple choice) and April 1 (word problems)
Final: Wednesday, May 5, from 3:30PM to 5:30PM (practice problems)