معرفی
Pooya Hatami is an Associate Professor in the Department of Computer Science and Engineering (CSE) at Ohio State University. His research focuses on theoretical computer science, with an emphasis on randomness, pseudorandomness, communication complexity, analysis of Boolean functions, additive combinatorics, and learning theory. He currently advises four students: Pushen Wang (CSE), Yuting Fang (CSE), Chavdar Lalov (Math), and Sivan Tretiak (Math).
His work has been supported by an NSF grant (CCF-1947546). He has contributed to major conferences and journals, including FOCS, STOC, and COLT. Notable recent contributions include refuting the Implicit Graph Conjecture (FOCS 2022) and foundational work on replicable learning algorithms (COLT 2025). He serves on program committees for SODA 2024 and FOCS 2025.
Key research themes include the interplay between communication complexity and algorithmic learning, with breakthroughs in pseudorandom generator design and structural results on Boolean functions.
