| Lower bounds for graph bootstrap percolation via properties of polynomials L Hambardzumyan, H Hatami, Y Qian Journal of Combinatorial Theory, Series A 174, 105253, 2020 | 24* | 2020 |
| Dimension-free bounds and structural results in communication complexity L Hambardzumyan, H Hatami, P Hatami Israel Journal of Mathematics 253 (2), 555-616, 2023 | 20 | 2023 |
| A counter-example to the probabilistic universal graph conjecture via randomized communication complexity L Hambardzumyan, H Hatami, P Hatami Discrete Applied Mathematics 322, 117-122, 2022 | 13 | 2022 |
| Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions Y Filmus, L Hambardzumyan, H Hatami, P Hatami, D Zuckerman arXiv preprint arXiv:1902.07426, 2019 | 11 | 2019 |
| Chang’s lemma via Pinsker’s inequality L Hambardzumyan, Y Li Discrete Mathematics 343 (1), 111496, 2020 | 4 | 2020 |
| An improved protocol for ExactlyN with more than 3 players L Hambardzumyan, T Pitassi, S Sherif, A Shraibman The 15th Innovations in Theoretical Computer Science 2024, 2024 | 3 | 2024 |
| No Complete Problem for Constant-Cost Randomized Communication Y Fang, L Hambardzumyan, N Harms, P Hatami arXiv preprint arXiv:2404.00812, 2024 | 2 | 2024 |
| Graphs, disjoint matchings and some inequalities L Hambardzumyan, V Mkrtchyan arXiv preprint arXiv:1512.02546, 2015 | 1 | 2015 |
| On depth-3 circuits and covering number: an explicit counter-example L Hambardzumyan, H Hatami, N Ndiaye arXiv preprint arXiv:2210.08300, 2022 | | 2022 |
