I’m an Assistant Professor of Computer Science at the University of Chicago. Before this, I was a postdoctoral fellow at the University of California, Berkeley through the Simons Institute for the Theory of Computing. I got my Ph.D. in Computer Science from the University of Texas at Austin in 2021, and I got my B.S. in Computer Science and Mathematics from the California Institute of Technology in 2016.
I study computational complexity theory. I want to understand the intrinsic relationships between computational resources such as time, memory, and randomness. I’m especially passionate about the challenge of converting randomized algorithms into deterministic algorithms without significantly increasing the amount of memory used. I’m also interested in pseudorandom generators, circuit complexity, and other related topics.
