Lianna Hambardzumyan

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 16

Top Topics

Coloured Petri Nets

Relevant Variables

Prime Implicants

Pseudo Boolean Functions

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
No Complete Problem for Constant-Cost Randomized Communication. CoRR (2024)
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
No Complete Problem for Constant-Cost Randomized Communication. Electron. Colloquium Comput. Complex. (2024)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS (2024)
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami
No Complete Problem for Constant-Cost Randomized Communication. STOC (2024)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. CoRR (2023)
Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye
On depth-3 circuits and covering number: an explicit counter-example. CoRR (2022)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. 322 (2022)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR (2021)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Lianna Hambardzumyan, Yaqiao Li
Chang's lemma via Pinsker's inequality. Discret. Math. 343 (1) (2020)
Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian
Lower bounds for graph bootstrap percolation via properties of polynomials. J. Comb. Theory, Ser. A 174 (2020)
Lianna Hambardzumyan, Yaqiao Li
Chang's lemma via Pinsker's inequality. CoRR (2020)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. 26 (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP (2019)
Lianna Hambardzumyan, Vahan Mkrtchyan
Cubic Graphs, Disjoint Matchings and Some Inequalities. CoRR (2015)