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):
- Comp 531, Advanced Complexity Theory, Fall 2021
- Comp 360, Algorithm design, Fall 2021
Books:
- Higher order Fourier analysis and applications, with Pooya Hatami and Shachar Lovett (Foundations and Trends in Theoretical Computer Science)
Students:
- Lianna Hambardzumyan PhD
- Stefan Grosser (co-advised with Sergey Norin), MSc
- Tal Elbaz, MSc
Previous students:
- Yaqioa Li PhD 2018
- Yingjie Qian MSc 2018
- Liana Yepremyan (co-advised with Sergey Norin), PhD 2016
- James Hirst, MSc 2014.
- Anil Ada PhD 2013, (cosupervised with professor Denis Therien).
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]
