Остановите войну!
for scientists:
default search action
Hamed Hatami
- > Home > Persons > Hamed Hatami
Publications
- 2024
- [i38]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR abs/2401.14623 (2024) - [i37]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. TR24: TR24-012 (2024) - 2023
- [c17]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. ICALP 2023: 42:1-42:13 - [i36]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. CoRR abs/2303.17578 (2023) - 2022
- [j32]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) - [c15]Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM 2022: 22:1-22:24 - [c14]Hamed Hatami, Pooya Hatami:
The Implicit Graph Conjecture is False. FOCS 2022: 1134-1137 - [i27]Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i26]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR abs/2111.10436 (2021) - [i25]Hamed Hatami, Pooya Hatami:
The Implicit Graph Conjecture is False. CoRR abs/2111.13198 (2021) - [i23]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2019
- [j27]Hamed Hatami, Pooya Hatami, Shachar Lovett:
Higher-order Fourier Analysis and Applications. Found. Trends Theor. Comput. Sci. 13(4): 247-448 (2019) - [c11]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 - [i21]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) - [i20]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) - 2016
- [j22]Hamed Hatami, Pooya Hatami, Yaqiao Li:
A characterization of functions with vanishing averages over products of disjoint sets. Eur. J. Comb. 56: 81-93 (2016) - 2014
- [j21]Hamed Hatami, Pooya Hatami, James Hirst:
Limits of Boolean Functions on $\mathbb{F}_p^n$. Electron. J. Comb. 21(4): 4 (2014) - [i13]Hamed Hatami, Pooya Hatami, Shachar Lovett:
General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c6]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. STOC 2013: 429-436 - 2012
- [i9]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012) - [i8]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. TR12 (2012) - 2007
- [j8]Hamed Hatami, Pooya Hatami:
Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electron. J. Comb. 14(1) (2007)
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-03-07 01:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint