William Hoza
University of Chicago CS · Assistant Professor of Computer Science
Research focus: computational complexity · derandomization · pseudorandom generators · circuit complexity
手动审核申请准备：申请人应展示复杂理论能力：derandomization、伪随机性、空间/时间权衡以及circuit complexity或基于严谨证明的理论。
Who this advisor fits / 什么情况下适合你
- Applicants should show complexity theory strength: derandomization, pseudorandomness, space/time tradeoffs, circuit complexity, or rigorous proof-based theory.
- 申请人应展示复杂性理论能力：derandomization、伪随机性、空间/时间权衡以及circuit complexity或基于严谨证明的理论。
What to watch for / 什么情况下要慎重
- You need strong placement evidence, but public signals for this PI are still thin.
- 你需要强证据的毕业去向分布，而这位 PI 目前公开信号仍较薄。
Public evidence as of 2026-06-10
These are decision-support signals compiled from public evidence (faculty pages, publications, lab sites) to help you ask better questions — not a ranking, rating, or allegation about this advisor. / 以上为基于公开信息整理的择校参考，帮助你提出更好的问题，并非排名、评分或对该导师的指控。
Ask a verified 学长学姐 / 同校 .edu 认证点评
The thing applicants say only 师兄师姐 can tell you — current & former students of this lab, verified by their school .edu. Open the full dossier to read or add a verified note.