Connor Mowry - PhD Student

About

I am a first-year PhD student in Computer Science at the University of Illinois at Urbana-Champaign, where I am fortunate to be advised by Chandra Chekuri and Karthik Chandrasekaran. My research focuses on graph algorithms, network optimization, and connectivity problems.

I completed my BS in Computer Science at Carnegie Mellon University in 2025, where I had the privilege of working with Jason Li on negative weight shortest path algorithms and Ryan O'Donnell on hypothesis testing.

Research Interests

Graph algorithms, network optimization, connectivity problems, combinatorial optimization

Publications

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
Jason Li, Connor Mowry, and Satish Rao
To appear in SODA 2026
arXiv:2510.22721

Non-iid hypothesis testing: from classical to quantum
Giacomo De Palma, Marco Fanizza, Connor Mowry, and Ryan O'Donnell
Submitted to QIP 2026
arXiv:2510.06147

Education

University of Illinois at Urbana-Champaign
PhD in Computer Science, 2025–Present
Advisors: Chandra Chekuri, Karthik Chandrasekaran

Carnegie Mellon University
BS in Computer Science, 2025
Concentration in Algorithms and Complexity