Lianna Hambardzumyan

According to our database, Lianna Hambardzumyan authored at least 10 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Factorization norms and an inverse theorem for MaxCut.

Igor Balla, Lianna Hambardzumyan, István Tomon

Electron. Colloquium Comput. Complex., 2025

2024

No Complete Problem for Constant-Cost Randomized Communication.

Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

An Improved Protocol for ExactlyN with More Than 3 Players.

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2022

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

Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami

Discret. Appl. Math., 2022

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

Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye

CoRR, 2022

2021

Dimension-free Bounds and Structural Results in Communication Complexity.

Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami

Electron. Colloquium Comput. Complex., 2021

2020

Lower bounds for graph bootstrap percolation via properties of polynomials.

Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian

J. Comb. Theory A, 2020

Chang's lemma via Pinsker's inequality.

Lianna Hambardzumyan, Yaqiao Li

Discret. Math., 2020

2019

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

Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2015

Cubic Graphs, Disjoint Matchings and Some Inequalities.

Lianna Hambardzumyan, Vahan Mkrtchyan

CoRR, 2015