The theory group hosts various reading groups, typically a semester or a year long, most topics chosen by students and/or postdocs; typically everyone presents. Some are for credit, all are for fun!

Current Reading Groups

Fall 2016 - present: Algorithmic economics (Profs. Rafael Frongillo and Bo Waggoner, sign up for the mailing list)

Fall 2016 - present: APPM 8500 / CSCI 7000 Statistics, Optimization, and Machine Learning Seminar (Profs. Stephen Becker and Rafael Frongillo)

Fall 2023 - present: Algorithmic fairness (Robin Bowers, Robby Green, Mary Monroe, sign up for the mailing list)

Spring 2024: Machine-independent complexity and formalization in theorem-provers (Prof. Josh Grochow)

Spring 2024: Submodular optimization (Prof. Bo Waggoner)

Spring 2024: Chalk-talk student series (Gülce Kardeş)

Past Reading Groups

Spring & Summer 2023: Information theory, Kolmogorov complexity, communication complexity, & related topics (Prof. Joshua Grochow)

Summer 2022: Algebraic and geometric complexity theory (Prof. Joshua Grochow)

Fall 2020: Representation theory of the symmetric group, w/ applications to TCS (CSCI 7000). (Michael Levet, Prof. Joshua Grochow)

Fall 2019 - Spring 2020: Hardness of approximation, PCP Theorem, Unique Games. (Prof. Alexandra Kolla)

Summer 2019: Quantum Computing (Nathan Lindzey)

Fall 2018 - Spring 2019: Approximation algorithms, metric embeddings. LP and SDP relaxations for Max Cut and Sparsest Cut. (Prof. Alexandra Kolla)

Fall 2016 - Spring 2017: Symbolic Dynamics (Prof. Rafael Frongillo)