Hamed Hatami


I'm an associate professor at the School of Computer Science and an associate member at the Department of Mathematics and Statistics at McGill University.

I received my PhD from the department of Computer Science, University of Toronto under the supervision of Professors Michael Molloy and Balazs Szegedy. Before joining McGill, I was a Veblen fellow at the Institute for Advanced Studies, and the Department of Mathematics, Princeton University.

My research interests are in Theoretical Computer Science and Pure Mathematics:

  • Communication complexity;
  • Analytic methods in combinatorics and theoretical Computer Science;
  • Fourier analysis of Boolean functions;
  • Additive combinatorics.

Teaching and pedagogical matters:


Publications:

  • Click here for All Publications.


  • Selected Publicatios in Theoretical Computer Science:

    • H. Hatami, Kaave Hosseini, Shachar Lovett, Sign-rank vs Discrepancy,
      Computational Complexity Conference (CCC 2020) [ECCC]

    • H. Hatami, Kaave Hosseini, Shachar Lovett, Structure of protocols for XOR functions,
      IEEE Annual Symposium on Foundations of Computer Science (FOCS 2016) [ECCC]

    • Yuval Dagan, Yuval Filmus, H. Hatami, Yaqiao Li, Trading information complexity for error,
      Computational Complexity Conference. (CCC 2017) [arXiv]

    • H. Hatami, Shachar Lovett, Estimating the distance from testable affine-invariant properties,
      EEE Annual Symposium on Foundations of Computer Science. (FOCS 2013) [arXiv]

    • Arnab Bhattacharyya, Eldar Fischer, H. Hatami, Pooya Hatami, Shachar Lovett, Every locally characterized affine-invariant property is testable,
      ACM Symposium on Theory of Computing. (STOC 2013) [arXiv]

  • Selected Publicatios in other areas of Mathematics:

    • H. Hatami, Sergey Norin, Undecidability of linear inequalities in graph homomorphism densities,
      Journal of the American Mathematical Society, 24(2) (2011), 547-565. [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, Pooya Hatami, Shachar Lovett, General systems of linear forms: equidistribution and true complexity,
      Advances in Mathematics 292 (2016), 446-477. [arXiv]

    • H. Hatami, Shachar Lovett, Higher-order Fourier analysis of F_p^n and the complexity of systems of linear forms,
      Geometric and Functional Analysis, 21 (2011), no. 6, 1331-1357. [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]


Surveys:


Email: hatami@cs.mcgill.ca
Office: MC 308
Mail Address:
McConnell Engineering Bldg, Room 318
3480 University St.,
Montreal, Quebec, Canada
H3A 0E9