Hamed Hatami
Associate Professor
School of Computer Science
McGill University
Theoretical Computer Science
- 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,
Kaave Hosseini,
Xiang Ming,
A Borsuk-Ulam lower bound for sign-rank and its applications,
STOC 2023 [ECCC]
- H. Hatami and Pooya Hatami,
The Implicit Graph Conjecture is False,
FOCS 2022
[arXiv]
- H. Hatami,
Kaave Hosseini,
Shachar Lovett,
Structure of protocols for XOR functions,
FOCS 2016
[ECCC]
- Arnab Bhattacharyya, Eldar Fischer,
H. Hatami, Pooya Hatami, Shachar Lovett,
Every locally characterized affine-invariant property is testable,
STOC 2013.
[arXiv]
Pure Mathematics
- Yuval Filmus, Esty Kelman, H. Hatami, Kaave Hosseini,
Sparse graph counting and Kelley-Meka bounds for binary systems,
FOCS 2024
[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. [arXiv]