Theo McKenzie is a PhD student at the University of California, Berkeley. He studies discrete and continuous optimization problems in graphs, as well as more generally. Recently he has been working on combinatorial problems relaxing random constraints into more general adversarial constraints. He is the lead instructor for the intermediate algebra course at San Quentin State Prison.
- Probability, Geometry, and Computation in High Dimensions, Fall 2020. Visiting Graduate Student.
- Geometry of Polynomials, Spring 2019. Visiting Graduate Student.
- Real-Time Decision Making, Spring 2018. Visiting Graduate Student.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Graduate Student.