Department of Computer Science and the College
William Hoza studies computational complexity theory, i.e., he seeks to understand the intrinsic power of computational resources such as time, space (a.k.a. memory), and randomness. He is especially interested in the role of randomness in computing, and much of his work has focused on clarifying the relationship between randomness and space complexity. To investigate these topics, he studies and develops the theory of pseudorandomness.
His research has been published in the proceedings of theoretical computer science conferences, including the Association for Computing Machinery Symposium on Theory of Computing, and the Institute of Electrical and Electronics Engineers Symposium on Foundations of Computer Science, as well as such journals as the Society for Industrial and Applied Mathematics Journal on Computing.
Hoza received a BS in computer science and mathematics from the California Institute of Technology and a PhD in computer science from the University of Texas at Austin. Most recently, he held a Simons-Berkeley postdoctoral fellowship at the University of California, Berkeley, through the Simons Institute for the Theory of Computing.