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 mathematics : Communication complexity, randomness and pseudo-randomness, Analytic methods in combinatorics and theoretical Computer Science, analysis of Boolean functions, additive combinatorics.


Teaching (Past):

Books:

Students:

Previous students:

Summer Research with Undergraduate Students

  • Noah Brustle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma, Approximation algorithms for hitting subgraphs, IWOCA2021 [arXiv]

  • Ralph Sarkis, Sean La, Pedro Feijao, Leonid Chindelevitch, Hamed Hatami, Computing rank medians is APX-hard, unpublished manuscript

  • Yuval Filmus, H. Hatami, Yaqiao Li, Suzin You, Information complexity of the AND function in the two-party and multi-party settings, COCOON 2017. [arXiv]

  • James Hirst, The Inducibility of Graphs on Four Vertices, Journal of Graph theory, 75 (3), 231-243, 2014 [arXiv]


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