Hedyeh Beyhaghi

COMPSCI 611 - Advanced Algorithms

Welcome to the Fall 2026 course webpage for COMPSCI 611 - Advanced Algorithms.

Course Information

• Instructor: Hedyeh Beyhaghi
• TAs: Ahmed Luqman, Vinayak
• Class Time: Mondays and Wednesdays, 4:00 PM - 5:15 PM
• Location: Computer Science Building room 150
• Slides: Slides will be posted on Canvas.

Textbooks

Primary Resource:

• Slides and lecture notes available on Canvas.

Additional References:

• Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein.
• Algorithm Design by Kleinberg and Tardos.
• Algorithms by Dasgupta, Papadimitriou, and Vazirani.
• Jeff Erickson’s Algorithms Textbook

Specific Topics in More Detail:

• Randomized Algorithms by Motwani and Raghavan.
• Probability and Computing by Mitzenmacher and Upfal.
• Approximation Algorithms by Vazirani.

Schedule

Here’s an approximate schedule for the course. Note that this will be updated as we go along depending on our progress.

Date	Topic	Events
Sep 9 (Wed)	Preliminaries, Mergesort, Master Theorem	-
Sep 14 (Mon)	Matrix Multiplication, Closest Pairs	-
Sep 16 (Wed)	Fast Fourier Transform	HW1 Release
Sep 21 (Mon)	Minimum Spanning Trees	-
Sep 23 (Wed)	Subset Systems, Matroids	-
Sep 28 (Mon)	Cardinality Theorem and Examples	-
Sep 30 (Wed)	Bipartite Matchings, The Union-Find Problem	HW1 Due, HW2 Release
Oct 5 (Mon)	Dynamic Programming: Knapsack, Floyd-Warshall	-
Oct 7 (Wed)	Dijkstra’s Algorithm	-
Oct 12 (Mon)	-	No Class
Oct 14 (Wed)	Seidel’s Algorithm	HW2 Due
Oct 19 (Mon)	Network Flow Part 1	-
Oct 21 (Wed)	-	Midterm (4:00-6:00 PM)
Oct 26 (Mon)	Network Flow Part 2	HW3 Release
Oct 28 (Wed)	Quicksort	-
Nov 2 (Mon)	Karger’s Algorithm	-
Nov 4 (Wed)	Tail Inequalities and Lazy Select	-
Nov 9 (Mon)	Chernoff Bounds and Balls & Bins	HW3 Due, HW4 Release
Nov 11 (Wed)	-	No Class
Nov 16 (Mon)	More Balls & Bins, Polynomial Multiplication	-
Nov 18 (Wed)	Approximation Algorithms
Nov 23 (Mon)	More Approximation: TSP & Weighted Set Cover	HW4 Due, HW5 Release
Nov 24 (Tue)	P vs. NP, Approximations, Independent Set	-
Nov 25 (Wed)	-	No Class
Nov 30 (Mon)	NP Completeness	-
Dec 2 (Wed)	More NP Completeness and Approximation Algorithms	-
Dec 7 (Mon)	Linear Programming, Simplex Method	-
Dec 9 (Wed)	Analysis of the Simplex Method	HW5 Due
Dec 14 (Mon)	Review	-
Dec 17 (Thu)	-	Final Exam (6:00-8:00 PM)

---

This site is powered by Just the Docs.