Hamed Hatami
Orcid: 0000-0002-4732-434X
According to our database1,
Hamed Hatami
authored at least 67 papers
between 2000 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Discret. Appl. Math., 2025
2024
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes.
SIGACT News, March, 2024
J. Comb. Theory B, 2024
Electron. Colloquium Comput. Complex., 2024
Electron. Colloquium Comput. Complex., 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
Inf. Process. Lett., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity.
Discret. Appl. Math., 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
2020
J. Comb. Theory A, 2020
2019
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
2018
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
Electron. Colloquium Comput. Complex., 2016
2014
Correlation Testing for Affine Invariant Properties on 픽<sub>p<sup>n</sup></sub> in the High Error Regime.
SIAM J. Comput., 2014
Electron. Colloquium Comput. Complex., 2014
2013
Electron. Colloquium Comput. Complex., 2013
2012
Random Struct. Algorithms, 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
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
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
2009
SIAM J. Discret. Math., 2009
Comb. Probab. Comput., 2009
2008
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
Random Struct. Algorithms, 2008
J. Comb. Theory B, 2008
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.
Inf. Process. Lett., 2008
2007
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
2005
J. Comb. Theory B, 2005
J. Comb. Theory B, 2005
2004
2000
Proceedings of the RoboCup 2000: Robot Soccer World Cup IV, 2000