Hamed Hatami

2025

• Ari Blondal, H. Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak, Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces,
  Submitted [arXiv]
  
  
• Ari Blondal, Shan Gao, H. Hatami, Pooya Hatami Stability and List-Replicability for Agnostic Learners,
  Submitted [arXiv]
  
  
• Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos, H. Hatami, Anthony Ostuni, A tight lower bound on non-adaptive group testing estimation,
  Discrete Appl. Math. 336 (2025), 1–15. [arXiv]
  
  

2024

• Yuval Filmus, Esty Kelman, H. Hatami, Kaave Hosseini, Sparse graph counting and Kelley-Meka bounds for binary systems,
  FOCS 2024 [arXiv]
  
  
• Tsun-Ming Cheung, H. Hatami, Rosie Zhao, Itai Zilberstein, Boolean functions with small approximate spectral norm,
  Discrete Analysis, (2024) [ArXiv]
  
  
• Manasseh Ahmed, Tsun-Ming Cheung, H. Hatami, Kusha Sareeni, Discrepancy and communication complexity of halfplanes,
  SoCG 2024 [ECCC]
  
  
• H. Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni, Refuting approaches to the log-rank conjecture for XOR functions,
  ICALP 2024 [arXiv]
  
  
• Stefan Grosser, H. Hatami, Peter Nelson, Sergey Norin, Typical structure of hereditary properties of binary matroids,
  J. Combin. Theory Ser. B, 167 (2024) 283-302 [arXiv]
  
  

2023

• Tsun-Ming Cheung, H. Hatami, Pooya Hatami, Kaave Hosseini, Online Learning and Disambiguations of Partial Concept Classes,
  ICALP 2023 (Best Paper Award) [ArXiv]
  
  
• H. Hatami, Kaave Hosseini, Xiang Ming, A Borsuk-Ulam lower bound for sign-rank and its applications,
  STOC 2023 [ECCC]
  
  
• Tsun-Ming Cheung, H. Hatami, Pooya Hatami, Kaave Hosseini, Morgan Shirley, Separation of the factorization norm and randomized communication complexity,
  CCC 2023 [ECCC]
  
  

2022

• H. Hatami and Pooya Hatami, The Implicit Graph Conjecture is False,
  FOCS 2022 [arXiv]
  
  
• Lianna Hambardzumyan, H. Hatami, Pooya Hatami, Dimension-free Bounds and Structural Results in Communication Complexity,
  Israel Journal of Mathematics (2022). [ECCC]
  
  
• H. Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao, Lower bound methods for sign-rank and their limitations,
  APPROX-RANDOM 2022 [ECCC]
  
  
• Lianna Hambardzumyan, H. Hatami, Pooya Hatami, A counter-example to the probabilistic universal graph conjecture via randomized communication complexity,
  Discrete Appl. Math. 322 (2022), 117–122. [arXiv]
  
  
• Ben Davis, Hamed Hatami, Ran Tao, William Pires, Hamza Usmani, On public-coin zero-error randomized communication complexity,
  Information Processing Letters (2022) [ECCC]
  
  

2021

• Noah Brustle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma, Approximation algorithms for hitting subgraphs,
  IWOCA 2021 [arXiv]
  
  

2020

• H. Hatami, Kaave Hosseini, Shachar Lovett, Sign rank vs Discrepancy,
  CCC 2020 [ECCC]
  
  
• Lianna Hambardzumyan, H. Hatami, Yingjie Qian, Lower bounds for graph bootstrap percolation via properties of polynomials,
  J. Combin. Theory Ser. A, 174 (2020), 105--253. [arXiv]
  
  

2019

• Yuval Filmus, Lianna Hambardzumyan, H. Hatami, Pooya Hatami, David Zuckerman, Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions,
  ICALP 2019 [ECCC]
  
  
• H. Hatami, Sergey Norin, On the boundary of the region defined by homomorphism densities,
  Journal of Combinatorics, 10 (2019), no. 2, 203--219. [arXiv]
  
  

2018

• H. Hatami, Svante Janson, Balazs Szegedy, Graph properties, graph limits and entropy,
  Journal of Graph Theory. 87 (2018), no. 2, 208--229. [arXiv]
  
  
• H. Hatami, Yingjie Qian, Teaching dimension, VC dimension, and critical sets in Latin squares,
  Journal of Combinatorics, 9 (2018), no. 1, 9--20. [arXiv]
  
  
• H. Hatami, Yingjie Qian, The Unbounded-Error Communication Complexity of symmetric XOR functions,
  submitted. [arXiv]
  
  

2017

• Yuval Filmus, H. Hatami, Yaqiao Li, Suzin You, Information complexity of the AND function in the two-party and multi-party settings,
  COCOON 2017 [arXiv]
  
  
• Yuval Dagan, Yuval Filmus, H. Hatami, Yaqiao Li, Trading information complexity for error,
  CCC 2017 [arXiv]
  
  

2016

• H. Hatami, Kaave Hosseini, Shachar Lovett, Structure of protocols for XOR functions,
  FOCS 2016 [ECCC]
  
  
• H. Hatami, Victoria de Quehen, On the additive bases problem in finite fields,
  Electronic Journal of Combinatorics, 23 (2016), no. 3, Paper 3.33. [arXiv]
  
  
• H. Hatami, Pooya Hatami, Yaqiao Li, A characterization of functions with vanishing averages over products of disjoint sets,
  European J. Combin. 56 (2016), 81--93. [arXiv]
  
  
• Yuval Filmus, H. Hatami, Nathan Keller, Noam Lifshitz, On the sum of the L1 influences of bounded functions,
  Israel Journal of Mathematics. (2016), no. 1, 167--192. [arXiv]
  
  
• H. Hatami, Pooya Hatami, Shachar Lovett, General systems of linear forms: equidistribution and true complexity,
  Advances in Mathematics 292 (2016), 446--477. [arXiv]
  
  

2014

• H. Hatami, Laszlo Lovasz, Balazs Szegedy, Limits of local-global convergent graph sequences,
  Geometric and Functional Analysis, 24 (2014), no. 1, 269–296. [arXiv]
  
  
• H. Hatami, James Hirst, Sergey Norin, The inducibility of blow-up graphs,
  J. Combin. Theory Ser. B 109 (2014), 196–212. [arXiv]
  
  

2013

• H. Hatami, Shachar Lovett, Estimating the distance from testable affine-invariant properties,
  FOCS 2013 [arXiv]
  
  
• Arnab Bhattacharyya, Eldar Fischer, H. Hatami, Pooya Hatami, Shachar Lovett, Every locally characterized affine-invariant property is testable,
  STOC 2013 [arXiv]
  
  
• H. Hatami, Sergey Norin, The entropy of random-free graphons and properties,
  Combinatorics Probability and Computing, 22 (2013), no. 4, 517–526. [arXiv]
  
  
• H. Hatami, Jan Hladky, Daniel Kral, Sergey Norin, Alexander Razborov, On the number of pentagons in triangle-free graphs,
  J. Combin. Theory Ser. A, 120 (2013), no. 3, 722-732. [arXiv]
  
  

2012

• H. Hatami, A structure theorem for Boolean functions with small total influences,
  Annals of Mathematics, 176 (2012), no. 1, 509–533. [arXiv]
  
  
• H. Hatami, Jan Hladky, Daniel Kral, Serguei Norine, Alexander Razborov, Non-three-colorable common graphs exist,
  Combinatorics Probability and Computing, 21 (2012), no. 5, 734-742. [arXiv]
  
  
• Anil Ada, Omar Fawzi, H. Hatami, Spectral norm of symmetric functions,
  APPROX-RANDOM 2012 [arXiv]
  
  

2011

• H. Hatami, Sergey Norin, Undecidability of linear inequalities in graph homomorphism densities,
  Journal of the American Mathematical Society, 24(2) (2011), 547-565. [arXiv]
  
  
• H. Hatami and Shachar Lovett, Correlation testing for affine invariant properties on F_p^n in the high error regime,
  STOC 2011 [arXiv]
  
  
• H. Hatami, Shachar Lovett, Higher-order Fourier analysis of F_p^n and the complexity of systems of linear forms,
  Geometric and Functional Analysis, 21 (2011), no. 6, 1331–1357. [arXiv]
  
  

MSc and PhD years

• H. Hatami, Michael Molloy, The scaling window for a random graph with a given degree sequence ,
  Random Structures & Algorithms , 41 (2012), no. 1, 99–123.
  SODA10 . [ arXiv]
  
  
• H. Hatami, Graph norms and Sidorenko's conjecture ,
  Israel Journal of Mathematics 175(1) (2010), 125-150. [arXiv]
  
  
• H. Hatami, Decision trees and influence of variables over product probability spaces,
  Combinatorics Probability and Computing 18 (2009), 357-369. [arXiv]
  
  
• H. Hatami, Xuding Zhu, The fractional chromatic number of graphs of maximum degree at most three,
  SIAM Journal on Discrete Mathematics 23(4) (2009), 1762-1775.
  
  
• Mahya Ghandehari, H. Hatami, Nico Spronk, Amenability constants for semilattice algebras,
  Semigroup forum 79(2) (2009), pp. 279-297. [arXiv]
  
  
• H. Hatami and Michael Molloy, Sharp thresholds for constraint satisfaction problem and graph homomorphisms ,
  Random Structures & Algorithms , 33(3) (2008), pp. 310-332. [arXiv]
  
  
• Mahya Ghandehari and H. Hatami, Fourier analysis and large independent sets in powers of complete graphs,
  J. Combin. Theory Ser. B 98(1), (2008), pp. 164-172. [arXiv]
  
  
• H. Hatami, Avner Magen, Vangelis Markakis, Integrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of Negative type metrics,
  SIAM Journal on Discrete Mathematics, 23(1) (2008/09), pp. 178-194. [arXiv]
  
  
• H. Hatami, A remark on Bourgain's distributional inequality on the Fourier spectrum of Boolean functions,
  Online Journal of Analytic Combinatorics 1 (2006). [download]
  
  
• H. Hatami, Random cubic graphs are not homomorphic to the cycle of size 7,
  J. Combin. Theory Ser. B 93(2) (2005) pp. 319-325. [arXiv]
  
  
• H. Hatami, Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number,
  J. Combin. Theory Ser. B 95(2) (2005) pp. 246-256. [arXiv]
  
  
• H. Hatami, Pooya Hatami, Perfect dominating sets in the Cartesian products of prime cycles,
  Electronic Journal of Combinatorics 14(8), (2007). [Download]
  
  
• Peyman Afshani and H. Hatami, Approximation and inapproximability results for maximum clique of disc graphs in high dimensions,
  Information Processing Letters, 105(3), (2008), pp. 83-87. [arXiv]
  
  

Undergrad years

• Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, H. Hatami, Ruzbeh Tusserkani, Xuding Zhu, Circular chromatic index of graphs of maximum degree 3,
  Journal of Graph Theory. 49(4) (2005) pp. 325-335. [arXiv]
  
  
• H. Hatami, Ruzbeh Tusserkani, On the complexity of the circular chromatic number,
  Journal of Graph Theory. 47(3) (2004) pp. 226-230. [arXiv]
  
  
• H. Hatami, Hossein Maserrat, On the computational complexity of defining sets,
  Journal of Discrete Applied Mathematics.149(1-3) (2005) pp. 101-110. [arXiv]
  
  
• Mahya Ghandehari, H. Hatami, E.S. Mahmoodian, On the size of the minimum critical set of a Latin square,
  Journal of Discrete Mathematics. 293(1-3) (2005) pp. 121-127. [arXiv]
  
  
• Peyman Afshani, H. Hatami, E.S. Mahmoodian, On the size of the spectrum of the forced matching number of graphs,
  Australasian Journal of Combinatorics, 30 (2004) pp. 147-160. [arXiv]
  
  
• H. Hatami, E.S. Mahmoodian, A lower bound for the size of the largest critical sets in Latin squares,
  Bulletin of the Institute of Combinatorics and its Applications (Canada). 38 (2003) pp.19-22. [arXiv]