This is an archive of the webpage for the Summer 2025 Theory Reading Group at Purdue University, which I organized (Prof. Kent Quanrud also helped out). The purpose of this group was for a group of students to discuss topics in Theoretical CS (Algorithms, Computational Complexity, etc.) which are not covered in a typical undergraduate/first graduate course.
Logistics
We met once a week (with some exceptions).
We followed Anupam Gupta’s Advanced Algorithms, Spring 2023 (CMU 15-580).
For any questions/concerns please email Mukul Agarwal at agarw396@purdue.edu.
Meeting Schedule
| 25/07/30 | Low-Diameter Decompositions and Low-Stretch Spanning Trees (notes link) 2:00 PM EDT, DSAI 1069, Zoom |
|---|---|
| 25/07/23 | Shortest Path Trees (notes link) 2:00 PM EDT, DSAI 1004, Zoom |
| 25/07/16 | No meeting |
| 25/07/09 | Arborescences (notes link) 2:00 PM EDT, DSAI 1004, Zoom |
| 25/07/02 | Arborescences (notes link) 2:00 PM EDT, DSAI 1004, Zoom |
| 25/06/25 | Randomized MST algorithm (notes link) 2:00 PM EDT, DSAI 1069, Zoom |
| 25/06/18 | Introduction, Minimum Spanning Trees (notes link) 2:00 PM EDT, DSAI 1004, Zoom |