The following pages link to Hamed Hatami (Q244281):
Displaying 50 items.
- A characterization of functions with vanishing averages over products of disjoint sets (Q281937) (← links)
- On the additive bases problem in finite fields (Q311548) (← links)
- On the sum of the \(L_1\) influences of bounded functions (Q312259) (← links)
- A structure theorem for Boolean functions with small total influences (Q447936) (← links)
- The inducibility of blow-up graphs (Q462932) (← links)
- Limits of Boolean functions on \(\mathbb{F}_p^n\) (Q463037) (← links)
- Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms (Q657865) (← links)
- Amenability constants for semilattice algebras (Q734971) (← links)
- Teaching dimension, VC dimension, and critical sets in Latin squares (Q1691211) (← links)
- On the boundary of the region defined by homomorphism densities (Q1713781) (← links)
- Random cubic graphs are not homomorphic to the cycle of size 7 (Q1767675) (← links)
- (Q1779488) (redirect page) (← links)
- On the size of the minimum critical set of a Latin square (Q1779489) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- On public-coin zero-error randomized communication complexity (Q2169433) (← links)
- Lower bounds for graph bootstrap percolation via properties of polynomials (Q2174952) (← links)
- Perfect dominating sets in the Cartesian products of prime cycles (Q2372893) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- Limits of locally-globally convergent graph sequences (Q2453451) (← links)
- Fourier analysis and large independent sets in powers of complete graphs (Q2464160) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- The entropy of random-free graphons and properties (Q2841488) (← links)
- The scaling window for a random graph with a given degree sequence (Q2909244) (← links)
- Non-three-colourable common graphs exist (Q2911071) (← links)
- Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime (Q2929703) (← links)
- The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three (Q3058529) (← links)
- On the complexity of the circular chromatic number (Q3159379) (← links)
- Spectral Norm of Symmetric Functions (Q3167408) (← links)
- Decision Trees and Influences of Variables Over Product Probability Spaces (Q3557496) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics (Q3603463) (← links)
- (Q4406883) (← links)
- (Q4470234) (← links)
- Trading information complexity for error (Q4568116) (← links)
- Graph properties, graph limits, and entropy (Q4604027) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- On the spectrum of the forced matching number of graphs (Q4820537) (← links)
- (Q5091215) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5093405) (← links)
- (Q5111146) (← links)
- (Q5133219) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics (Q5189507) (← links)
- Circular chromatic index of graphs of maximum degree 3 (Q5311922) (← links)
- Undecidability of linear inequalities in graph homomorphism densities (Q5390541) (← links)
- Correlation testing for affine invariant properties on F <sub>p</sub> <sup>n</sup> in the high error regime (Q5419088) (← links)
- (Q5491335) (← links)
