Lianna Hambardzumyan

24 papers A* 3A 1Journal 20
YearRankTypeTitle / Venue / Authors
2026 J jnl
Spiky Rank and Its Applications to Rigidity and Circuits.
CoRR
Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman
2026 J jnl
Spiky Rank and Its Applications to Rigidity and Circuits.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman
2025 A* conf
Factorization norms and an inverse theorem for MaxCut.
FOCS
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
Factorization norms and an inverse theorem for MaxCut.
CoRR
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
Factorization norms and an inverse theorem for MaxCut.
Electron. Colloquium Comput. Complex.
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
The Log-Rank Conjecture: New Equivalent Formulations.
CoRR
Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
2025 J jnl
The Log-Rank Conjecture: New Equivalent Formulations.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
2024 A conf
An Improved Protocol for ExactlyN with More Than 3 Players.
ITCS
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2024 A* conf
No Complete Problem for Constant-Cost Randomized Communication.
STOC
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
2024 J jnl
No Complete Problem for Constant-Cost Randomized Communication.
CoRR
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
2024 J jnl
No Complete Problem for Constant-Cost Randomized Communication.
Electron. Colloquium Comput. Complex.
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
CoRR
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2023 J jnl
An improved protocol for ExactlyN with more than 3 players.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
2022 J jnl
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity.
Discret. Appl. Math.
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2022 J jnl
On depth-3 circuits and covering number: an explicit counter-example.
CoRR
Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye
2021 J jnl
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity.
CoRR
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2021 J jnl
Dimension-free Bounds and Structural Results in Communication Complexity.
Electron. Colloquium Comput. Complex.
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2020 J jnl
Chang's lemma via Pinsker's inequality.
CoRR
Lianna Hambardzumyan, Yaqiao Li
2020 J jnl
Chang's lemma via Pinsker's inequality.
Discret. Math.
Lianna Hambardzumyan, Yaqiao Li
2020 J jnl
Lower bounds for graph bootstrap percolation via properties of polynomials.
J. Comb. Theory A
Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian
2019 A* conf
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
ICALP
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019 J jnl
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
CoRR
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019 J jnl
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
Electron. Colloquium Comput. Complex.
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2015 J jnl
Cubic Graphs, Disjoint Matchings and Some Inequalities.
CoRR
Lianna Hambardzumyan, Vahan Mkrtchyan