Charlie Carlson
PhD
Research Topics
Approximate counting; combinatorial optimization; convex optimization; spectral graph theory; statistical physics; and randomized algorithms
Courses
- CSE 331—Algorithms and Complexity (Fall 2025)
Approximate counting; combinatorial optimization; convex optimization; spectral graph theory; statistical physics; and randomized algorithms