Cubic Graphs, Disjoint Matchings and Some Inequalities. - Lianna Hambardzumyan; Vahan Mkrtchyan (CoRR, 2015)

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. - Yuval Filmus; Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Chang's lemma via Pinsker's inequality. - Lianna Hambardzumyan; Yaqiao Li (Discret. Math., 2020)

Lower bounds for graph bootstrap percolation via properties of polynomials. - Lianna Hambardzumyan; Hamed Hatami; Yingjie Qian (J. Comb. Theory A, 2020)

Dimension-free Bounds and Structural Results in Communication Complexity. - Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami (Electron. Colloquium Comput. Complex., 2021)

On depth-3 circuits and covering number: an explicit counter-example. - Lianna Hambardzumyan; Hamed Hatami; Ndiamé Ndiaye (CoRR, 2022)

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. - Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami (Discret. Appl. Math., 2022)

An improved protocol for ExactlyN with more than 3 players. - Lianna Hambardzumyan; Toniann Pitassi; Suhail Sherif; Morgan Shirley; Adi Shraibman (Electron. Colloquium Comput. Complex., 2023)

No Complete Problem for Constant-Cost Randomized Communication. - Yuting Fang; Lianna Hambardzumyan; Nathaniel Harms; Pooya Hatami (Electron. Colloquium Comput. Complex., 2024)

Factorization norms and an inverse theorem for MaxCut. - Igor Balla; Lianna Hambardzumyan; István Tomon (Electron. Colloquium Comput. Complex., 2025)