Toggle navigation
CSE 373 Spring 2019
Home
Links
Syllabus
Administrative
Policies
Lectures
Homeworks
Archive
RSS
Analysis of Algorithms
Recent Posts
Recommended reading for Approximation Algorithms (2)
Recommended reading for Approximation Algorithms (1)
Recommended reading for Complexity (1)
Recommended reading for Network Flow (3)
Recommended reading for Network Flow (2)
Other algorithm resources
Required text: Algorithm Design (Kleinberg & Tardos)
Slides for K&T
PDF: Algorithms (Dasgupta et al.)
Algorithm Design Manual (Skiena)
Indroduction to Algorithms (CLRS)
2019
May 2 - Recommended reading for Approximation Algorithms (2)
Apr 30 - Recommended reading for Approximation Algorithms (1)
Apr 16 - Recommended reading for Complexity (1)
Apr 9 - Recommended reading for Network Flow (3)
Apr 2 - Recommended reading for Network Flow (2)
Mar 28 - Recommended reading for Bellman Ford and Max Flow
Mar 14 - Recommended reading for Dynamic Programing Lectures 2 & 3
Mar 5 - Recommended reading for Dynamic Programing Lecture 1
Feb 21 - Recommended reading for Lecture 7
Feb 18 - Recommended reading for Lecture 6
Feb 12 - Recommended reading for Lecture 5
Feb 7 - Recommended reading for Lecture 4
Feb 5 - Recommended reading for Lecture 3
Jan 31 - Recommended reading for Lecture 2
Jan 29 - Recommended reading for Lecture 1
Jan 26 - Welcome to CSE373