default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLianna Hambardzumyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif
, Morgan Shirley, Adi Shraibman:
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS 2024: 58:1-58:23- [c2]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. STOC 2024: 1287-1298 - [i11]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. CoRR abs/2404.00812 (2024) - [i10]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i9]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. CoRR abs/2309.06554 (2023) - [i8]Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman:
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j3]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. 322: 117-122 (2022) - [i7]Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye:
On depth-3 circuits and covering number: an explicit counter-example. CoRR abs/2210.08300 (2022) - 2021
- [i6]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR abs/2111.10436 (2021) - [i5]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j2]Lianna Hambardzumyan, Yaqiao Li:
Chang's lemma via Pinsker's inequality. Discret. Math. 343(1): 111496 (2020) - [j1]Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian:
Lower bounds for graph bootstrap percolation via properties of polynomials. J. Comb. Theory A 174: 105253 (2020) - [i4]Lianna Hambardzumyan, Yaqiao Li:
Chang's lemma via Pinsker's inequality. CoRR abs/2005.10830 (2020)
2010 – 2019
- 2019
- [c1]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP 2019: 58:1-58:13 - [i3]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR abs/1902.07426 (2019) - [i2]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. TR19 (2019) - 2015
- [i1]Lianna Hambardzumyan, Vahan Mkrtchyan:
Cubic Graphs, Disjoint Matchings and Some Inequalities. CoRR abs/1512.02546 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
