Hamed Hatami

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 50

Top Topics

Boolean Functions

Prime Implicants

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Hamed Hatami, Pooya Hatami
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. SIGACT News 55 (1) (2024)
Hamed Hatami, Pooya Hatami
Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. (2024)
Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen
Communication Complexity and Discrepancy of Halfplanes. SoCG (2024)
Stefan Grosser, Hamed Hatami, Peter Nelson, Sergey Norin
Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167 (2024)
Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP (2024)
Hamed Hatami, Pooya Hatami
Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR (2024)
Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. (2023)
Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
Refuting approaches to the log-rank conjecture for XOR functions. CoRR (2023)
Manasseh Ahmed, TsunMing Cheung, Hamed Hatami, Kusha Sareen
Communication complexity of half-plane membership. Electron. Colloquium Comput. Complex. (2023)
TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
Online Learning and Disambiguations of Partial Concept Classes. ICALP (2023)
Tsun-Ming Cheung, Hamed Hatami, Anthony Ostuni
A tight lower bound on non-adaptive group testing estimation. CoRR (2023)
TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
Online Learning and Disambiguations of Partial Concept Classes. CoRR (2023)
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
Separation of the Factorization Norm and Randomized Communication Complexity. CCC (2023)
Hamed Hatami, Kaave Hosseini, Xiang Meng
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC (2023)
Hamed Hatami, Kaave Hosseini, Xiang Meng
A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. (2022)
Hamed Hatami, Pooya Hatami
The Implicit Graph Conjecture is False. FOCS (2022)
Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao
Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM (2022)
Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani
On public-coin zero-error randomized communication complexity. Inf. Process. Lett. 178 (2022)
Kaave Hosseini, Hamed Hatami, Shachar Lovett
Sign-Rank vs. Discrepancy. Theory Comput. 18 (2022)
Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao
Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. (2022)
Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye
On depth-3 circuits and covering number: an explicit counter-example. CoRR (2022)
TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. (2022)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. 322 (2022)
TsunMing Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein
Boolean functions with small approximate spectral norm. Electron. Colloquium Comput. Complex. (2022)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR (2021)
Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani
On public-coin zero-error randomized communication complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Hamed Hatami, Pooya Hatami
The Implicit Graph Conjecture is False. CoRR (2021)
Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
Approximation Algorithms for Hitting Subgraphs. IWOCA (2021)
Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian
Lower bounds for graph bootstrap percolation via properties of polynomials. J. Comb. Theory, Ser. A 174 (2020)
Hamed Hatami, Kaave Hosseini, Shachar Lovett
Sign Rank vs Discrepancy. Computational Complexity Conference (2020)
Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
Approximation algorithms for hitting subgraphs. CoRR (2020)
Hamed Hatami, Pooya Hatami, Shachar Lovett
Higher-order Fourier Analysis and Applications. Found. Trends Theor. Comput. Sci. 13 (4) (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR (2019)
Hamed Hatami, Kaave Hosseini, Shachar Lovett
Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. 26 (2019)
Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Algorithmica 81 (11-12) (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. 26 (2019)
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP (2019)
Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
Trading Information Complexity for Error. Theory Comput. 14 (1) (2018)
Hamed Hatami, Kaave Hosseini, Shachar Lovett
Structure of Protocols for XOR Functions. SIAM J. Comput. 47 (1) (2018)
Hamed Hatami, Svante Janson, Balázs Szegedy
Graph properties, graph limits, and entropy. J. Graph Theory 87 (2) (2018)
Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. COCOON (2017)
Hamed Hatami, Yingjie Qian
The Unbounded-Error Communication Complexity of symmetric XOR functions. CoRR (2017)
Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
Information complexity of the AND function in the two-Party, and multiparty settings. CoRR (2017)
Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
Trading Information Complexity for Error. Computational Complexity Conference (2017)
Hamed Hatami, Kaave Hosseini, Shachar Lovett
Structure of Protocols for XOR Functions. FOCS (2016)
Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
Trading information complexity for error. Electron. Colloquium Comput. Complex. 23 (2016)
Hamed Hatami, Pooya Hatami, Yaqiao Li
A characterization of functions with vanishing averages over products of disjoint sets. Eur. J. Comb. 56 (2016)
Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
Trading information complexity for error. CoRR (2016)
Victoria de Quehen, Hamed Hatami
On the Additive Bases Problem in Finite Fields. Electron. J. Comb. 23 (3) (2016)
Hamed Hatami, Shachar Lovett
in the High Error Regime. SIAM J. Comput. 43 (4) (2014)
Hamed Hatami, Pooya Hatami, James Hirst
Limits of Boolean Functions on $\mathbb{F}_p^n$. Electron. J. Comb. 21 (4) (2014)
Hamed Hatami, Pooya Hatami, Shachar Lovett
General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. 21 (2014)
Yuval Filmus, Hamed Hatami
Bounds on the sum of L1 influences. CoRR (2014)
Hamed Hatami, James Hirst, Serguei Norine
The inducibility of blow-up graphs. J. Comb. Theory, Ser. B 109 (2014)
Hamed Hatami, Serguei Norine
The Entropy of Random-Free Graphons and Properties. Comb. Probab. Comput. 22 (4) (2013)
Hamed Hatami, Shachar Lovett
Estimating the distance from testable affine-invariant properties. Electron. Colloquium Comput. Complex. 20 (2013)
Hamed Hatami, Shachar Lovett
Estimating the distance from testable affine-invariant properties. CoRR (2013)
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
On the number of pentagons in triangle-free graphs. J. Comb. Theory, Ser. A 120 (3) (2013)
Hamed Hatami, Shachar Lovett
Estimating the Distance from Testable Affine-Invariant Properties. FOCS (2013)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable. STOC (2013)
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21 (5) (2012)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. 19 (2012)
Anil Ada, Omar Fawzi, Hamed Hatami
Spectral Norm of Symmetric Functions. APPROX-RANDOM (2012)
Anil Ada, Omar Fawzi, Hamed Hatami
Spectral Norm of Symmetric Functions CoRR (2012)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable CoRR (2012)
Hamed Hatami, Michael Molloy
The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41 (1) (2012)
Hamed Hatami, Shachar Lovett
in the high error regime. Electron. Colloquium Comput. Complex. 18 (2011)
Hamed Hatami, Shachar Lovett
in the high error regime. STOC (2011)
Hamed Hatami, Shachar Lovett
Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime CoRR (2011)
Hamed Hatami, Shachar Lovett
and the complexity of systems of linear forms. Electron. Colloquium Comput. Complex. 17 (2010)
Hamed Hatami, Michael Molloy
The Scaling Window for a Random Graph with a Given Degree Sequence. SODA (2010)
Hamed Hatami, Xuding Zhu
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discret. Math. 23 (4) (2009)
Hamed Hatami
Decision Trees and Influences of Variables Over Product Probability Spaces. Comb. Probab. Comput. 18 (3) (2009)
Peyman Afshani, Hamed Hatami
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. 105 (3) (2008)
Hamed Hatami, Michael Molloy
Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33 (3) (2008)
Mahya Ghandehari, Hamed Hatami
Fourier analysis and large independent sets in powers of complete graphs. J. Comb. Theory, Ser. B 98 (1) (2008)
Hamed Hatami, Avner Magen, Evangelos Markakis
Embeddability of Negative Type Metrics. SIAM J. Discret. Math. 23 (1) (2008)
Hamed Hatami, Ruzbeh Tusserkani
On the Complexity of the Circular Chromatic Number CoRR (2007)
Hamed Hatami, Avner Magen, Evangelos Markakis
Embeddability of Negative Type Metrics. APPROX-RANDOM (2007)
Hamed Hatami, Pooya Hatami
Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electron. J. Comb. 14 (1) (2007)
Peyman Afshani, Hamed Hatami
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions CoRR (2007)
Hamed Hatami, Hossein Maserrat
On the Computational Complexity of Defining Sets CoRR (2007)
Hamed Hatami, Avner Magen, Vangelis Markakis
embeddability of Negative Type metrics CoRR (2006)
Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian
On the size of the minimum critical set of a Latin square. Discret. Math. 293 (1-3) (2005)
Hamed Hatami
Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory, Ser. B 95 (2) (2005)
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49 (4) (2005)
Hamed Hatami
Random cubic graphs are not homomorphic to the cycle of size 7. J. Comb. Theory, Ser. B 93 (2) (2005)
Hamed Hatami, Hossein Maserrat
On the computational complexity of defining sets. Discret. Appl. Math. 149 (1-3) (2005)
Hamed Hatami, Ruzbeh Tusserkani
On the complexity of the circular chromatic number. J. Graph Theory 47 (3) (2004)
Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
On the spectrum of the forced matching number of graphs. Australas. J Comb. 30 (2004)
Jafar Habibi, Ehsan Foroughi, Mehran Motamed, Pooya Karimian, Hamed Hatami, Hossein Fardad
SharifII Soccer Simulation Team. RoboCup (2000)