Hi there! I'm a PhD in Computer Science at McGill University (Montreal, Canada).
Here I'm lucky to have Hamed Hatami as my advisor.
For the first and second years of my PhD, I have been co-supervised by Prakash Panangaden.
Prior coming to McGill, I received both my bachelor's and masters degrees from Yerevan State University (Yerevan, Armenia) in Informatics and Applied Mathematics.
My current research interests include:
- Communication complexity
- Analysis of Boolean functions
Dimension-free Bounds and Structural Results in Communication Complexitywith Hamed Hatami, Pooya Hatami, [ECCC]
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributionswith Yuval Filmus, Hamed Hatami, Pooya Hatami, David Zuckerman, [ECCC]
Chang's lemma via Pinsker's inequalitywith Yaqiao Li, [arxiv]
- Discrete Mathematics, Volume 343, Issue 1, 2020
- CanaDAM 2019
Lower bounds for graph bootstrap percolation via properties of polynomialswith Hamed Hatami, Yingjie Qian, [arxiv]
- Journal of Combinatorial Theory, Series A, Volume 174, 2020
Graphs, Disjoint Matchings and Some Inequalitieswith Vahan Mkrtchyan, [arxiv], (submitted)