University of Utah Theory Reading Group

We are a student-led reading group at the Kahlert School of Computing, and every week we host a talk in theoretical computer science research from topics across the field. All are welcome!

Logistics

Time: Wednesdays, 3:30-5:00pm, often with snacks!

Location: tbd

Contact: Eli Friedman (eli.friedman at utah.edu). Send questions, comments, or requests to speak.

Spring 2026 Schedule

Date	Speaker	Title
January 21	Siddhant Chaudhary	Concentration Inequalities with Sparse Dependencies
January 28
February 4

Previous Terms

Fall 2025

Fall 2025 Schedule

Date	Speaker	Title
September 5	Alex Crane	Edge Modification for Probabilistic Graphs [BCJ+25]
September 12	Siddhant Chaudhary	Learning Entangled Single-Sample Gaussians [CDKL14]
September 16	Eli Friedman	Threshold Algorithms for Prophet Inequality Problems
October 14	Md Mumtahin Habib Ullah Mazumder	Maximizing Non-monotone Submodular Functions [FMV11]
October 21	Dylan McKellips	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs [KKS23]
November 4	Prasanth Yalamanchili	Graph Sparsification
November 11	Bruce Brewer	Voronoi Diagrams
November 18	Anastasiia Tkachenko	Computing Dominating Sets in Disk Graphs with Centers in Convex Position [TW25]