E-LIB Suche - Ergebnisse für: Hambardzumyan, Lianna

1

No Complete Problem for Constant-Cost Randomized Communicat..:

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

Fang, Yuting ; Hambardzumyan, Lianna ; Harms, Nathaniel. - p. 1287-1298 , 2024

Link: https://dl.acm.org/doi/1..

2

Dimension-free bounds and structural results in communicati..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Hatami, Pooya
Israel Journal of Mathematics. 253 (2022) 2 - p. 555-616 , 2022

Link: https://doi.org/10.1007/..

3

A counter-example to the probabilistic universal graph conj..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Hatami, Pooya
Discrete Applied Mathematics. 322 (2022) - p. 117-122 , 2022

Link: https://doi.org/10.1016/..

4

Chang's lemma via Pinsker's inequality:

Hambardzumyan, Lianna ; Li, Yaqiao
Discrete Mathematics. 343 (2020) 1 - p. 111496 , 2020

Link: https://doi.org/10.1016/..

5

Lower bounds for graph bootstrap percolation via properties..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Qian, Yingjie
Journal of Combinatorial Theory, Series A. 174 (2020) - p. 105253 , 2020

Link: https://doi.org/10.1016/..

6

An Improved Protocol for ExactlyN with More Than 3 Players:

Hambardzumyan, Lianna ; Pitassi, Toniann ; Sherif, Suhail..
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). , 2024

Link: https://doi.org/10.4230/..

7

An improved protocol for ExactlyN with more than 3 players:

Hambardzumyan, Lianna ; Pitassi, Toniann ; Sherif, Suhail..
http://arxiv.org/abs/2309.06554. , 2023

Link: http://arxiv.org/abs/230..

8

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

Hambardzumyan, Lianna ; Hatami, Hamed ; Ndiaye, Ndiamé
http://arxiv.org/abs/2210.08300. , 2022

Link: http://arxiv.org/abs/221..

9

A counter-example to the probabilistic universal graph conj..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Hatami, Pooya
http://arxiv.org/abs/2111.10436. , 2021

Link: http://arxiv.org/abs/211..

10

Chang's lemma via Pinsker's inequality:

Hambardzumyan, Lianna ; Li, Yaqiao
http://arxiv.org/abs/2005.10830. , 2020

Link: http://arxiv.org/abs/200..

11

Biasing Boolean Functions and Collective Coin-Flipping Prot..:

Filmus, Yuval ; Hambardzumyan, Lianna ; Hatami, Hamed..
doi:10.4230/LIPIcs.ICALP.2019.58. , 2019

Link: https://doi.org/10.4230/..

12

Biasing Boolean Functions and Collective Coin-Flipping Prot..:

Filmus, Yuval ; Hambardzumyan, Lianna ; Hatami, Hamed..
http://arxiv.org/abs/1902.07426. , 2019

Link: http://arxiv.org/abs/190..

13

Lower bounds for graph bootstrap percolation via properties..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Qian, Yingjie
http://arxiv.org/abs/1708.04640. , 2017

Link: http://arxiv.org/abs/170..

14

Graphs, Disjoint Matchings and Some Inequalities:

Hambardzumyan, Lianna ; Mkrtchyan, Vahan
http://arxiv.org/abs/1512.02546. , 2015

Link: http://arxiv.org/abs/151..