معرفی
William Hoza is an Assistant Professor in the Department of Computer Science at the University of Chicago, affiliated with the UChicago CS Theory Group. His research focuses on computational complexity theory, particularly pseudorandom generators, derandomization of space-bounded computation, and circuit complexity. He earned a Ph.D. in Computer Science from the University of Texas at Austin (2021) and a B.S. from the California Institute of Technology (2016). Hoza advises two PhD students, including Zelin Lv (co-advised with Aaron Potechin). He has taught courses such as Introduction to Complexity Theory, Pseudorandomness, and Circuit Complexity.
His academic journey includes a postdoctoral fellowship at UC Berkeley's Simons Institute. Hoza's work bridges theoretical computer science and practical algorithm design, with contributions to derandomization techniques and pseudorandom generator constructions.
Key contributions include research on hitting sets, branching programs, and the limitations of pseudorandom generators. His publications span venues like FOCS, STOC, and ITCS, addressing foundational questions in computational complexity.
