Hamed Hatami

According to our database1, Hamed Hatami authored at least 43 papers between 2000 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Lower bounds for graph bootstrap percolation via properties of polynomials.
J. Comb. Theory, Ser. A, 2020

2019
Higher-order Fourier Analysis and Applications.
Foundations and Trends in Theoretical Computer Science, 2019

Sign rank vs Discrepancy.
Electronic Colloquium on Computational Complexity (ECCC), 2019

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
Electronic Colloquium on Computational Complexity (ECCC), 2019

Information Complexity of the AND Function in the Two-Party and Multi-party Settings.
Algorithmica, 2019

2018
Trading Information Complexity for Error.
Theory of Computing, 2018

Structure of Protocols for XOR Functions.
SIAM J. Comput., 2018

Graph properties, graph limits, and entropy.
Journal of Graph Theory, 2018

2017
The Unbounded-Error Communication Complexity of symmetric XOR functions.
CoRR, 2017

Information complexity of the AND function in the two-Party, and multiparty settings.
CoRR, 2017

2016
A characterization of functions with vanishing averages over products of disjoint sets.
Eur. J. Comb., 2016

On the Additive Bases Problem in Finite Fields.
Electr. J. Comb., 2016

2014
Correlation Testing for Affine Invariant Properties on 픽pn in the High Error Regime.
SIAM J. Comput., 2014

The inducibility of blow-up graphs.
J. Comb. Theory, Ser. B, 2014

General systems of linear forms: equidistribution and true complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Bounds on the sum of L1 influences.
CoRR, 2014

Limits of Boolean Functions on $\mathbb{F}_p^n$.
Electr. J. Comb., 2014

2013
On the number of pentagons in triangle-free graphs.
J. Comb. Theory, Ser. A, 2013

Estimating the distance from testable affine-invariant properties.
Electronic Colloquium on Computational Complexity (ECCC), 2013

The Entropy of Random-Free Graphons and Properties.
Comb. Probab. Comput., 2013

2012
The scaling window for a random graph with a given degree sequence.
Random Struct. Algorithms, 2012

Every locally characterized affine-invariant property is testable.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Non-Three-Colourable Common Graphs Exist.
Comb. Probab. Comput., 2012

Spectral Norm of Symmetric Functions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Correlation testing for affine invariant properties on Fpn in the high error regime.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime
CoRR, 2011

2010
Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms.
Electronic Colloquium on Computational Complexity (ECCC), 2010

2009
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three.
SIAM J. Discret. Math., 2009

Decision Trees and Influences of Variables Over Product Probability Spaces.
Comb. Probab. Comput., 2009

2008
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics.
SIAM J. Discret. Math., 2008

Sharp thresholds for constraint satisfaction problems and homomorphisms.
Random Struct. Algorithms, 2008

Fourier analysis and large independent sets in powers of complete graphs.
J. Comb. Theory, Ser. B, 2008

Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.
Inf. Process. Lett., 2008

2007
Perfect Dominating Sets in the Cartesian Products of Prime Cycles.
Electr. J. Comb., 2007

Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics.
Proceedings of the Approximation, 2007

2005
Circular chromatic index of graphs of maximum degree 3.
Journal of Graph Theory, 2005

Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number.
J. Comb. Theory, Ser. B, 2005

Random cubic graphs are not homomorphic to the cycle of size 7.
J. Comb. Theory, Ser. B, 2005

On the size of the minimum critical set of a Latin square.
Discret. Math., 2005

On the computational complexity of defining sets.
Discret. Appl. Math., 2005

2004
On the complexity of the circular chromatic number.
Journal of Graph Theory, 2004

On the spectrum of the forced matching number of graphs.
Australas. J Comb., 2004

2000
SharifII Soccer Simulation Team.
Proceedings of the RoboCup 2000: Robot Soccer World Cup IV, 2000


  Loading...