Pooya Hatami
Computer Science · The Ohio State University
Publications
80
Citations
411
Est. group size
—
Recurring co-author estimate
Active years
20
Publishing since 2007
Pooya Hatami works in theoretical computer science, focusing on the mathematical foundations of computation, learning, and information. Their work explores communication complexity (how much information parties must exchange to solve a problem jointly), pseudorandomness (methods for generating sequences that behave like random ones), and 'replicability' in machine learning, which studies whether learning algorithms produce consistent results across different runs. This research is largely theoretical, using tools from combinatorics, algebra, and graph theory to prove mathematical guarantees or limitations for algorithms.
Publication output has fluctuated over the last decade, with a peak around 2018-2019, a slower period in 2020-2023, and a recent resurgence in 2024-2026.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
2026
- Tight list replicability bounds via a novel sphere covering theorem
arXiv (Cornell University) · 2026
- Tight list replicability bounds via a novel sphere covering theorem
arXiv (Cornell University) · 2026
- Sign-Rank, Index, and List Replicability: Connections and Separations
arXiv (Cornell University) · 2026
- Sign-Rank, Index, and List Replicability: Connections and Separations
arXiv (Cornell University) · 2026
- Constant-Cost Communication Is Not Reducible to k-Hamming Distance
2025
- Stability and List-Replicability for Agnostic Learners
arXiv (Cornell University) · 2025
- Simplicial Covering Dimension of Extremal Concept Classes
arXiv (Cornell University) · 2025
- Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes
ACM SIGACT News · 2024
- No Complete Problem for Constant-Cost Randomized Communication
2024
- Structure in Communication Complexity and Constant-Cost Complexity Classes
arXiv (Cornell University) · 2024
- Paradigms for Unconditional Pseudorandom Generators
Foundations and Trends® in Theoretical Computer Science · 2024
- Paradigms for Unconditional Pseudorandom Generators
2024
- No Complete Problem for Constant-Cost Randomized Communication
arXiv (Cornell University) · 2024
- Hilbert Functions and Low-Degree Randomness Extractors
arXiv (Cornell University) · 2024
- arXiv (Cornell University)×17
- Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×6
- Electron. Colloquium Comput. Complex.×5
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×3
- Foundations and Trends® in Theoretical Computer Science×2
- Elena Grigorescu
Computer Science · Purdue University West Lafayette
- Kent Quanrud
Computer Science · Purdue University West Lafayette
- Qin Zhang
Computer Science · Indiana University
- Billy Jin
Computer Science · Purdue University West Lafayette
- Zeyu Guo
Computer Science · The Ohio State University
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 19, 2026.
Claim or correct this profile