CS Theory @ UIowa
Our research focuses on the theoretical aspects of computation. We work across a range of topics in theoretical computer science.
- Distributed algorithms
- Computational geometry & optimization
- Pseudorandomness & property testing
- Learning & stochastic systems
Algorithms Reading Group. B11 MacLean Hall, Wednesdays, 5–6 p.m.
Upcoming events
Reading group
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
Hongyan Ji
News and events
Colloquium
Approximation Algorithms: Some ancient, some new – the good, the bad and the ugly
Samir Khuller · Northwestern University
Colloquium
Easy, Hard, and Impossible: Phase Transitions in Computation
Cristopher Moore · Santa Fe Institute
Publication
Faster Set Cover in the MPC Model published in Theoretical Computer Science
Hongyan Ji; Shreyas Pai; Sriram V. Pemmaraju; Joshua Sobel
Publication
Approximating Minimum Dominating Set with Few Awake Rounds accepted at DISC 2026
Hongyan Ji; Shreyas Pai; Sriram V. Pemmaraju
Colloquium
A Hessian View of Fine-tuning, Task Attribution, and Reinforcement Learning: Three Vignettes in Modern Machine Learning
Hongyang R. Zhang · Northeastern University
Award
Faster Set Cover in the MPC Model receives the ICDCN 2025 Best Paper Award in the Distributed Computing track
Hongyan Ji; Shreyas Pai; Sriram V. Pemmaraju; Joshua Sobel