CS 473 (Fall 2026)

Algorithms


Instructor

Timothy Chan (tmc "at" illinois.edu)

TAs

Harshul Sagar (harshul4), Yuancheng Yu (yyu51)

CAs

Ian Chen (ianchen3), Ajitesh Dasaratha (asd11), Navid Tajkhorshid (navidt), ...

Lecture Time/Place

Tue & Thu 2:00pm-3:15pm, Loomis Lab 151

Office Hours

(starting Aug 30 onward). All office hours are held in the open study space in the basement of Siebel (unless stated otherwise). Check Ed for the latest updates to the office hours.

Administrivia

Homework

Exams

About the Course

CS 473 (also cross-listed as Math 473 and CSE 414) is an algorithms course aimed at advanced undergraduates and graduate students in computer science and related disciplines. The course covers a wide range of topics in algorithm design and analysis, including the following:

Prerequisites: CS/ECE 374 or equivalent, or graduate standing (see things you should already know)

[Note: grad students who have not taken a theory-oriented algorithms course at the level of CS 374 may be interested instead in the new CS498M24 "MCS Algorithms" course this semester.]

Lectures

Although lectures will be recorded, it is expected that students will attend most of the lectures. Recordings may be accessed on mediaspace for registered students. I will provide scribbles from class, and some links to relevant resources, below. There is no textbook, but Jeff's book and notes are excellent. (Other useful general resources can be found here.)