Instructor: Amir Nayyeri (Office hours: Mon 4:00pm-5:00pm at KEC 3061)
TA: Baigong Zheng (Office hours: Thr 4:00pm-5:00pm at KEC Atrium), Prashant Kumar (Office hours: Fri 2:00pm-3:00pm at KEC Atrium)
Lectures: Mon, Wed 10:00am-11:50am in BEXL 412
Tentative topic list: Recursive algorithms, Dynamic programming, Greedy algorithms, Randomized algorithms and data structures, Treaps, Hashing*, Network flow, Linear programming, NP-hardness*, Approximation algorithms*.
Prerequisites: Graduate standing in computer science and an undergraduate course in algorithms.
Evaluation:
Resources: