CS:5350 Design and Analysis of Algorithms

Fall 2019, 9:30-10:45 TTh 15 SH (Schaeffer Hall)

Instructor: Sriram V. Pemmaraju
101G MLH, sriram-pemmaraju@uiowa.edu, 319-353-2956
Office Hours: 1:30-2:30 M, 10:30-11:30 W, 2:00-3:00 F (and by appointment).

Course webpage: homepage.cs.uiowa.edu/~sriram/5350/fall19/
Department website: http://www.cs.uiowa.edu/

This is the graduate algorithms course aimed at CS PhD students. It will be assumed that a typical student in the course has a solid background in undergraduate-level algorithms material. Please refer to the syllabus of a recent offering of CS:3330 (e.g., https://homepage.divms.uiowa.edu/~sriram/3330/spring18/syllabus.html) to better understand this expectation. Facility in discrete math, especially discrete probability, will be a definite benefit for students in this course. The course material is organized into 4 parts: (i) combinatorial optimization, (ii) randomized algorithms, (iii) approximation algorithms, and (iv) streaming and parallel algorithms. The material on streaming and parallel algorithms can be viewed as a modern application of the material in Parts (I)-(III).

Syllabus document, Announcements, Homeworks and Exams, Online Resources, Weekly Topics


Homeworks and Exams

Other Resources

Weekly Topics