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.