Instructor: Amir Nayyeri (Office hours: Wed 2-3pm at KEC 3061)
TA: Baigong Zheng (Office hours: Mon 4-5pm at KEC Atrium), Hung Le (Office hours: Fri 4-5pm at KEC Atrium)
Lectures: Mon, Wed 10:00am-11:50am in KEAR 212
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. I assume that the students are comfortable with CS325 material.