Hamed Hatami
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Introduction to Analysis of Boolean Functions 1 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Develops Fourier analysis on finite abelian groups and the Boolean cube, proving that characters are roots of unity, that a non‑principal character sums to… | ||
| Introduction to Analysis of Boolean Functions 2 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Defines convolution and proves its Fourier transform becomes a pointwise product so averaging operators (Hamming balls, measures) translate cleanly into… | ||
| Trading Information Complexity for Error | Structure vs. Randomness 2017 | 2017-04-10 |
Paper proves that allowing error ε reduces information cost for AND by Θ(H(ε)) and for Disjointness the per-instance cost drops by about H(ε) (matching earlier… | ||
| Undecidability of Linear Inequalities Between Graph Homomorphism Densities | Neo-Classical Methods in Discrete Analysis 2013 | 2013-12-02 |
Proves that deciding whether a linear inequality between graph homomorphism densities holds for all graphs is undecidable. Proof reduces… | ||
| A Structure Theorem for Boolean Functions with Small Total Influences | Functional Inequalities in Discrete Spaces with Applications 2013 | 2013-09-30 |
A structural theorem says Boolean functions on a product probability space with constant total influence are L2-close to a K-pseudo-junta defined by a family… | ||
| nothing matches | ||