Lianna Hambardzumyan

On depth-3 circuits and covering number: an explicit counter-example

Hamed Hatami, Lianna Hambardzumyan, Ndiamé Ndiaye, 2022, 2210.08300.

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions

Pooya Hatami, David Zuckerman, Yuval Filmus, 2019, Electron. Colloquium Comput. Complex..

Dimension-free bounds and structural results in communication complexity

Pooya Hatami, Hamed Hatami, Lianna Hambardzumyan, 2022, Israel Journal of Mathematics.

Cubic Graphs, Disjoint Matchings and Some Inequalities pdf

Vahan V. Mkrtchyan, Lianna Hambardzumyan, V. Mkrtchyan, 2015, ArXiv.

Graphs, Disjoint Matchings and Some Inequalities

Lianna Hambardzumyan, Vahan Mkrtchyan, V. Mkrtchyan, 2015, 1512.02546.

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity pdf

Pooya Hatami, Hamed Hatami, Lianna Hambardzumyan, 2021, Discret. Appl. Math..

Chang's lemma via Pinsker's inequality pdf

Yaqiao Li, Lianna Hambardzumyan, Yaqiao Li, 2020, Discret. Math..