Selected Publications
Theoretical Computer Science
- [arXiv] Ari Blondal, H. Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak, Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces,
STOC 2026 - [arXiv] Yuval Filmus, Esty Kelman, H. Hatami, Kaave Hosseini, Sparse graph counting and Kelley-Meka bounds for binary systems,
FOCS 2024 - [arXiv] Tsun-Ming Cheung, H. Hatami, Pooya Hatami, Kaave Hosseini, Online Learning and Disambiguations of Partial Concept Classes,
ICALP 2023 (Best Paper Award) - [arXiv] H. Hatami and Pooya Hatami, The Implicit Graph Conjecture is False,
FOCS 2022 - [ECCC] H. Hatami, Kaave Hosseini, Shachar Lovett, Structure of protocols for XOR functions,
FOCS 2016
Pure Mathematics
- [arXiv] Marcel K. Goh and H. Hatami, Block complexity and idempotent Schur multipliers,
International Mathematics Research Notices (2025) - [arXiv] H. Hatami, Pooya Hatami, Shachar Lovett, General systems of linear forms: equidistribution and true complexity,
Advances in Mathematics 292 (2016), 446-477. - [arXiv] H. Hatami, Laszlo Lovasz, Balazs Szegedy, Limits of local-global convergent graph sequences,
Geometric and Functional Analysis, 24 (2014), no. 1, 269-296. - [arXiv] H. Hatami, A structure theorem for Boolean functions with small total influences,
Annals of Mathematics, 176 (2012), no. 1, 509-533. - [arXiv] H. Hatami, Sergey Norin, Undecidability of linear inequalities in graph homomorphism densities,
Journal of the American Mathematical Society, 24(2) (2011), 547-565.