Publications

Lianna Hambardzumyan, H. Hatami, Pooya Hatami,
Dimensionfree Bounds and Structural Results in Communication Complexity,
submitted .
[ECCC]
 Stefan Grosser, H. Hatami, Peter Nelson, Sergey Norin,
Typical structure of hereditary properties of binary matroids,
submitted .
[arXiv]
 Noah Brustle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma,
Approximation algorithms for hitting subgraphs,
International Workshop on Combinatorial Algorithms (IWOCA 2021) .
[arXiv]
 H. Hatami,
Kaave Hosseini,
Shachar Lovett,
Sign rank vs Discrepancy,
Computational Complexity Conference (CCC 2020) .
[ECCC]
 Yuval Filmus, Lianna Hambardzumyan, H. Hatami, Pooya Hatami, David Zuckerman,
Biasing Boolean Functions and Collective CoinFlipping Protocols over Arbitrary Product Distributions,
ICALP 2019, [ECCC]
 Lianna Hambardzumyan, H. Hatami, Yingjie Qian,
Lower bounds for graph bootstrap percolation via properties of polynomials,
J. Combin. Theory Ser. A, 174 (2020), 105253. [arXiv]
 H. Hatami, Sergey Norin,
On the boundary of the region defined by homomorphism densities,
Journal of Combinatorics, 10 (2019), no. 2, 203219. [arXiv]
 H. Hatami, Yingjie Qian,
The UnboundedError Communication Complexity of symmetric XOR functions,
submitted. [arXiv]
 Yuval Filmus, H. Hatami, Yaqiao Li, Suzin You,
Information complexity of the AND function in the twoparty and multiparty settings,
COCOON 2017. [arXiv]
 Yuval Dagan,
Yuval Filmus,
H. Hatami, Yaqiao Li,
Trading information complexity for error,
Computational Complexity Conference (CCC 2017). [arXiv]
 H. Hatami,
Kaave Hosseini,
Shachar Lovett,
Structure of protocols for XOR functions,
IEEE Annual Symposium on Foundations of Computer Science (FOCS 2016).
[ECCC]
 H. Hatami, Yingjie Qian,
Teaching dimension, VC dimension, and critical sets in Latin squares,
Journal of Combinatorics, 9 (2018), no. 1, 920. [arXiv]
 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), 8193. [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, 167192. [arXiv]
 H. Hatami,
Pooya Hatami,
Shachar Lovett,
General systems of linear forms: equidistribution and true complexity,
Advances in Mathematics 292 (2016), 446477.
[arXiv]
 H. Hatami, Svante Janson, Balazs Szegedy,
Graph properties, graph limits and entropy,
Journal of Graph Theory. 87 (2018), no. 2, 208229. [arXiv]
 H. Hatami, Laszlo Lovasz, Balazs Szegedy,
Limits of localglobal convergent graph sequences,
Geometric and Functional Analysis, 24 (2014), no. 1, 269–296. [arXiv]
 H. Hatami, Pooya Hatami, James Hirst,
Limits of Boolean Functions on F_p^n,
Electronic Journal of Combinatorics 21(4), (2014). [Download]
 H. Hatami, James Hirst,
Serguei Norine,
The inducibility of blowup graphs,
J. Combin. Theory Ser. B 109 (2014), 196–212. [arXiv]
 H. Hatami Shachar Lovett,
Estimating the distance from testable affineinvariant properties,
EEE Annual Symposium on Foundations of Computer Science (FOCS 2013). [arXiv]
 Arnab Bhattacharyya,
Eldar Fischer,
H. Hatami,
Pooya Hatami,
Shachar Lovett,
Every locally characterized affineinvariant property is testable,
STOC 2013.
[arXiv]
 H. Hatami, Serguei Norine,
The entropy of randomfree graphons and properties,
Combinatorics Probability and Computing, 22 (2013), no. 4, 517–526. [arXiv]
 H. Hatami and Shachar Lovett,
Correlation testing for affine invariant properties on F_p^n in the high error regime,
Annual ACM Symposium on Theory of Computing (STOC 2011). [arXiv]
 Anil Ada, Omar Fawzi, H. Hatami,
Spectral norm of symmetric functions,
APPROXRANDOM 2012: 338349. [arXiv]
 H. Hatami, Jan Hladky,
Daniel Kral,
Serguei Norine,
Alexander Razborov,
On the number of pentagons in trianglefree graphs,
J. Combin. Theory Ser. A, 120 (2013), no. 3, 722732.
[arXiv]
 H. Hatami, Jan Hladky,
Daniel Kral,
Serguei Norine,
Alexander Razborov,
Nonthreecolorable common graphs exist,
Combinatorics Probability and Computing, 21 (2012), no. 5, 734742.
[arXiv]
 H. Hatami, A structure theorem for Boolean functions with small total influences,
Annals of Mathematics, 176 (2012), no. 1, 509–533.
[arXiv]
 H. Hatami, Shachar Lovett, Higherorder 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]
 H. Hatami, Serguei Norine,
Undecidability of linear inequalities in graph homomorphism densities,
Journal of the American Mathematical Society, 24(2) (2011), 547565. [arXiv]
Graduate school
 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), 125150. [arXiv]
 H. Hatami, Decision trees and influence of variables over product probability spaces,
Combinatorics Probability and Computing 18 (2009), 357369. [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), 17621775.
 Mahya Ghandehari, H. Hatami, Nico Spronk,
Amenability constants for semilattice algebras,
Semigroup forum 79(2) (2009), pp. 279297. [arXiv]
 H. Hatami, Michael Molloy,
Sharp thresholds for constraint satisfaction problem and graph homomorphisms ,
Random Structures & Algorithms , 33(3) (2008), pp. 310332. [arXiv]
 Mahya Ghandehari, H. Hatami,
Fourier analysis and large independent sets in powers of complete graphs,
J. Combin. Theory Ser. B 98(1), (2008), pp. 164172. [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. 178194. [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. 319325. [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. 246256. [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, H. Hatami,
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions,
Information Processing Letters, 105(3), (2008), pp. 8387. [arXiv]
Undergraduate
 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. 325335. [arXiv]
 H. Hatami, Ruzbeh Tusserkani, On the complexity
of the circular chromatic number,
Journal of Graph Theory. 47(3) (2004) pp. 226230. [arXiv]
 H. Hatami, Hossein Maserrat, On the computational
complexity of defining sets,
Journal of Discrete Applied Mathematics .149(13) (2005) pp. 101110. [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(13) (2005) pp. 121127. [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. 147160. [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.1922. [arXiv]