default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamed Hatami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Stefan Grosser, Hamed Hatami, Peter Nelson
, Sergey Norin:
Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167: 283-302 (2024)- [j33]Hamed Hatami, Pooya Hatami:
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. SIGACT News 55(1): 67-93 (2024) - [c21]Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen:
Communication Complexity and Discrepancy of Halfplanes. SoCG 2024: 5:1-5:17 - [c20]Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman:
Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. FOCS 2024: 1559-1578 - [c19]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP 2024: 82:1-82:11 - [i39]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR abs/2401.14623 (2024) - [i38]Tsun-Ming Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein:
Boolean Functions with Small Approximate Spectral Norm. CoRR abs/2409.10634 (2024) - [i37]Hamed Hatami, Pooya Hatami:
Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c18]Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
Separation of the Factorization Norm and Randomized Communication Complexity. CCC 2023: 1:1-1:16 - [c17]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. ICALP 2023: 42:1-42:13 - [c16]Hamed Hatami, Kaave Hosseini, Xiang Meng:
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC 2023: 463-471 - [i36]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. CoRR abs/2303.17578 (2023) - [i35]Tsun-Ming Cheung, Hamed Hatami, Anthony Ostuni:
A tight lower bound on non-adaptive group testing estimation. CoRR abs/2309.10286 (2023) - [i34]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting approaches to the log-rank conjecture for XOR functions. CoRR abs/2312.09400 (2023) - [i33]Manasseh Ahmed, TsunMing Cheung, Hamed Hatami, Kusha Sareen:
Communication complexity of half-plane membership. Electron. Colloquium Comput. Complex. TR23 (2023) - [i32]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. TR23 (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) - [j31]Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
On public-coin zero-error randomized communication complexity. Inf. Process. Lett. 178: 106293 (2022) - [j30]Kaave Hosseini, Hamed Hatami, Shachar Lovett:
Sign-Rank vs. Discrepancy. Adv. Math. Commun. 18: 1-22 (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 - [i31]Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye:
On depth-3 circuits and covering number: an explicit counter-example. CoRR abs/2210.08300 (2022) - [i30]TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i29]TsunMing Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein:
Boolean functions with small approximate spectral norm. Electron. Colloquium Comput. Complex. TR22 (2022) - [i28]Hamed Hatami, Kaave Hosseini, Xiang Meng:
A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. TR22 (2022) - [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
- [c13]Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma:
Approximation Algorithms for Hitting Subgraphs. IWOCA 2021: 370-384 - [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) - [i24]Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
On public-coin zero-error randomized communication complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i23]Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j29]Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian:
Lower bounds for graph bootstrap percolation via properties of polynomials. J. Comb. Theory A 174: 105253 (2020) - [c12]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Sign Rank vs Discrepancy. CCC 2020: 18:1-18:14 - [i22]Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma:
Approximation algorithms for hitting subgraphs. CoRR abs/2011.14450 (2020)
2010 – 2019
- 2019
- [j28]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Algorithmica 81(11-12): 4200-4237 (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) - [i19]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j26]Hamed Hatami, Svante Janson, Balázs Szegedy:
Graph properties, graph limits, and entropy. J. Graph Theory 87(2): 208-229 (2018) - [j25]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Structure of Protocols for XOR Functions. SIAM J. Comput. 47(1): 208-217 (2018) - [j24]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. Theory Comput. 14(1): 1-73 (2018) - 2017
- [c10]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. CCC 2017: 16:1-16:59 - [c9]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. COCOON 2017: 200-211 - [e1]Hamed Hatami, Pierre McKenzie, Valerie King:
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. ACM 2017, ISBN 978-1-4503-4528-6 [contents] - [i18]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information complexity of the AND function in the two-Party, and multiparty settings. CoRR abs/1703.07833 (2017) - [i17]Hamed Hatami, Yingjie Qian:
The Unbounded-Error Communication Complexity of symmetric XOR functions. CoRR abs/1704.00777 (2017) - 2016
- [j23]Victoria de Quehen, Hamed Hatami:
On the Additive Bases Problem in Finite Fields. Electron. J. Comb. 23(3): 3 (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) - [c8]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Structure of Protocols for XOR Functions. FOCS 2016: 282-288 - [i16]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. CoRR abs/1611.06650 (2016) - [i15]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [j21]Hamed Hatami, Pooya Hatami, James Hirst:
Limits of Boolean Functions on 𝔽pn. Electron. J. Comb. 21(4): 4 (2014) - [j20]Hamed Hatami, James Hirst, Serguei Norine:
The inducibility of blow-up graphs. J. Comb. Theory B 109: 196-212 (2014) - [j19]Hamed Hatami, Shachar Lovett:
Correlation Testing for Affine Invariant Properties on 픽pn in the High Error Regime. SIAM J. Comput. 43(4): 1417-1455 (2014) - [i14]Yuval Filmus, Hamed Hatami:
Bounds on the sum of L1 influences. CoRR abs/1404.3396 (2014) - [i13]Hamed Hatami, Pooya Hatami, Shachar Lovett:
General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j18]Hamed Hatami, Serguei Norine:
The Entropy of Random-Free Graphons and Properties. Comb. Probab. Comput. 22(4): 517-526 (2013) - [j17]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
On the number of pentagons in triangle-free graphs. J. Comb. Theory A 120(3): 722-732 (2013) - [c7]Hamed Hatami, Shachar Lovett:
Estimating the Distance from Testable Affine-Invariant Properties. FOCS 2013: 237-242 - [c6]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. STOC 2013: 429-436 - [i12]Hamed Hatami, Shachar Lovett:
Estimating the distance from testable affine-invariant properties. CoRR abs/1306.0649 (2013) - [i11]Hamed Hatami, Shachar Lovett:
Estimating the distance from testable affine-invariant properties. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j16]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21(5): 734-742 (2012) - [j15]Hamed Hatami, Michael Molloy:
The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1): 99-123 (2012) - [c5]Anil Ada, Omar Fawzi, Hamed Hatami:
Spectral Norm of Symmetric Functions. APPROX-RANDOM 2012: 338-349 - [i10]Anil Ada, Omar Fawzi, Hamed Hatami:
Spectral Norm of Symmetric Functions. CoRR abs/1205.5282 (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) - 2011
- [c4]Hamed Hatami, Shachar Lovett:
Correlation testing for affine invariant properties on Fpn in the high error regime. STOC 2011: 187-194 - [i7]Hamed Hatami, Shachar Lovett:
Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime. CoRR abs/1104.3335 (2011) - [i6]Hamed Hatami, Shachar Lovett:
Correlation testing for affine invariant properties on Fpn in the high error regime. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [b1]Hamed Hatami:
On Generalizations of Gowers Norms. University of Toronto, Canada, 2010 - [c3]Hamed Hatami, Michael Molloy:
The Scaling Window for a Random Graph with a Given Degree Sequence. SODA 2010: 1403-1411 - [i5]Hamed Hatami, Shachar Lovett:
Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j14]Hamed Hatami:
Decision Trees and Influences of Variables Over Product Probability Spaces. Comb. Probab. Comput. 18(3): 357-369 (2009) - [j13]Hamed Hatami, Xuding Zhu:
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discret. Math. 23(4): 1762-1775 (2009) - 2008
- [j12]Peyman Afshani, Hamed Hatami:
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. 105(3): 83-87 (2008) - [j11]Mahya Ghandehari, Hamed Hatami:
Fourier analysis and large independent sets in powers of complete graphs. J. Comb. Theory B 98(1): 164-172 (2008) - [j10]Hamed Hatami, Michael Molloy:
Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33(3): 310-332 (2008) - [j9]Hamed Hatami, Avner Magen, Evangelos Markakis:
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. SIAM J. Discret. Math. 23(1): 178-194 (2008) - 2007
- [j8]Hamed Hatami, Pooya Hatami:
Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electron. J. Comb. 14(1) (2007) - [c2]Hamed Hatami, Avner Magen, Evangelos Markakis:
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. APPROX-RANDOM 2007: 164-179 - [i4]Hamed Hatami, Ruzbeh Tusserkani:
On the Complexity of the Circular Chromatic Number. CoRR abs/cs/0701007 (2007) - [i3]Hamed Hatami, Hossein Maserrat:
On the Computational Complexity of Defining Sets. CoRR abs/cs/0701008 (2007) - [i2]Peyman Afshani, Hamed Hatami:
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions. CoRR abs/cs/0701009 (2007) - 2006
- [i1]Hamed Hatami, Avner Magen, Vangelis Markakis:
Integrality gaps of semidefinite programs for Vertex Cover and relations to ℓ1 embeddability of Negative Type metrics. CoRR abs/cs/0601011 (2006) - 2005
- [j7]Hamed Hatami, Hossein Maserrat:
On the computational complexity of defining sets. Discret. Appl. Math. 149(1-3): 101-110 (2005) - [j6]Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian:
On the size of the minimum critical set of a Latin square. Discret. Math. 293(1-3): 121-127 (2005) - [j5]Hamed Hatami:
Random cubic graphs are not homomorphic to the cycle of size 7. J. Comb. Theory B 93(2): 319-325 (2005) - [j4]Hamed Hatami:
Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory B 95(2): 246-256 (2005) - [j3]Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005) - 2004
- [j2]Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian:
On the spectrum of the forced matching number of graphs. Australas. J Comb. 30: 147-160 (2004) - [j1]Hamed Hatami, Ruzbeh Tusserkani:
On the complexity of the circular chromatic number. J. Graph Theory 47(3): 226-230 (2004) - 2000
- [c1]Jafar Habibi, Ehsan Foroughi, Mehran Motamed, Pooya Karimian, Hamed Hatami, Hossein Fardad:
SharifII Soccer Simulation Team. RoboCup 2000: 437-440
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 2025-01-09 12:49 CET 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:
