Hamed Hatami

According to our database1, Hamed Hatami authored at least 58 papers between 2000 and 2023.

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



In proceedings 
PhD thesis 


On csauthors.net:


Communication complexity of half-plane membership.
Electron. Colloquium Comput. Complex., 2023

A tight lower bound on non-adaptive group testing estimation.
CoRR, 2023

A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Online Learning and Disambiguations of Partial Concept Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Sign-Rank vs. Discrepancy.
Theory Comput., 2022

On public-coin zero-error randomized communication complexity.
Inf. Process. Lett., 2022

Lower Bound Methods for Sign-rank and their Limitations.
Electron. Colloquium Comput. Complex., 2022

A Borsuk-Ulam lower bound for sign-rank and its application.
Electron. Colloquium Comput. Complex., 2022

Boolean functions with small approximate spectral norm.
Electron. Colloquium Comput. Complex., 2022

Separation of the factorization norm and randomized communication complexity.
Electron. Colloquium Comput. Complex., 2022

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity.
Discret. Appl. Math., 2022

On depth-3 circuits and covering number: an explicit counter-example.
CoRR, 2022

The Implicit Graph Conjecture is False.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Dimension-free Bounds and Structural Results in Communication Complexity.
Electron. Colloquium Comput. Complex., 2021

Approximation Algorithms for Hitting Subgraphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

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

Higher-order Fourier Analysis and Applications.
Found. Trends Theor. Comput. Sci., 2019

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
Electron. Colloquium Comput. Complex., 2019

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

Trading Information Complexity for Error.
Theory Comput., 2018

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

Graph properties, graph limits, and entropy.
J. Graph Theory, 2018

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

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

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

Correlation Testing for Affine Invariant Properties on 픽<sub>p<sup>n</sup></sub> 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.
Electron. Colloquium Comput. Complex., 2014

Bounds on the sum of L1 influences.
CoRR, 2014

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

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

Estimating the distance from testable affine-invariant properties.
Electron. Colloquium Comput. Complex., 2013

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

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

Every locally characterized affine-invariant property is testable.
Electron. Colloquium Comput. Complex., 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

Correlation testing for affine invariant properties on F<sub>p</sub><sup>n</sup> in the high error regime.
Electron. Colloquium Comput. Complex., 2011

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

On Generalizations of Gowers Norms.
PhD thesis, 2010

Higher-order Fourier analysis of F<sub>p</sub><sup>n</sup> and the complexity of systems of linear forms.
Electron. Colloquium Comput. Complex., 2010

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

Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l<sub>1</sub> 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

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

Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to <i>l</i><sub>1</sub> Embeddability of Negative Type Metrics.
Proceedings of the Approximation, 2007

Circular chromatic index of graphs of maximum degree 3.
J. 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

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

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

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