Hamed Hatami - RankMe

105 papers A* 14A 6C 2Misc 1Journal 79Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Simplicial Covering Dimension of Extremal Concept Classes. ITCS Ari Blondal, Hamed Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
2025	A	`conf`	A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications. ITCS Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2025	J	`jnl`	A tight lower bound on non-adaptive group testing estimation. Discret. Appl. Math. Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos, Hamed Hatami, Anthony Ostuni
2025	J	`jnl`	Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces. CoRR Ari Blondal, Hamed Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
2025	J	`jnl`	Separation of the Factorization Norm and Randomized Communication Complexity. Comput. Complex. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2025	J	`jnl`	Simplicial covering dimension of extremal concept classes. CoRR Ari Blondal, Hamed Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
2025	A*	`conf`	Stability and List-Replicability for Agnostic Learners. COLT Ari Blondal, Shan Gao, Hamed Hatami, Pooya Hatami
2025	J	`jnl`	Stability and List-Replicability for Agnostic Learners. CoRR Ari Blonda, Shan Gao, Hamed Hatami, Pooya Hatami
2024	J	`jnl`	A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. Electron. Colloquium Comput. Complex. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2024	J	`jnl`	Boolean Functions with Small Approximate Spectral Norm. CoRR Tsun-Ming Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein
2024	A*	`conf`	Communication Complexity and Discrepancy of Halfplanes. SoCG Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen
2024	J	`jnl`	Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. SIGACT News Hamed Hatami, Pooya Hatami
2024	A*	`conf`	Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2024	A*	`conf`	Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. FOCS Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman
2024	J	`jnl`	Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR Hamed Hatami, Pooya Hatami
2024	J	`jnl`	Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. Hamed Hatami, Pooya Hatami
2024	J	`jnl`	Typical structure of hereditary properties of binary matroids. J. Comb. Theory B Stefan Grosser, Hamed Hatami, Peter Nelson, Sergey Norin
2023	A*	`conf`	A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC Hamed Hatami, Kaave Hosseini, Xiang Meng
2023	J	`jnl`	A tight lower bound on non-adaptive group testing estimation. CoRR Tsun-Ming Cheung, Hamed Hatami, Anthony Ostuni
2023	J	`jnl`	Communication complexity of half-plane membership. Electron. Colloquium Comput. Complex. Manasseh Ahmed, TsunMing Cheung, Hamed Hatami, Kusha Sareen
2023	A*	`conf`	Online Learning and Disambiguations of Partial Concept Classes. ICALP TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
2023	J	`jnl`	Online Learning and Disambiguations of Partial Concept Classes. CoRR TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. CoRR Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	A	`conf`	Separation of the Factorization Norm and Randomized Communication Complexity. CCC Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2022	J	`jnl`	A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Xiang Meng
2022	J	`jnl`	A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2022	J	`jnl`	Boolean functions with small approximate spectral norm. Electron. Colloquium Comput. Complex. TsunMing Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein
2022	A	`conf`	Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao
2022	J	`jnl`	Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao
2022	J	`jnl`	On depth-3 circuits and covering number: an explicit counter-example. CoRR Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye
2022	J	`jnl`	On public-coin zero-error randomized communication complexity. Inf. Process. Lett. Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani
2022	J	`jnl`	Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2022	J	`jnl`	Sign-Rank vs. Discrepancy. Theory Comput. Kaave Hosseini, Hamed Hatami, Shachar Lovett
2022	A*	`conf`	The Implicit Graph Conjecture is False. FOCS Hamed Hatami, Pooya Hatami
2021	J	`jnl`	A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2021	C	`conf`	Approximation Algorithms for Hitting Subgraphs. IWOCA Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
2021	J	`jnl`	Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami
2021	J	`jnl`	On public-coin zero-error randomized communication complexity. Electron. Colloquium Comput. Complex. Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani
2021	J	`jnl`	The Implicit Graph Conjecture is False. CoRR Hamed Hatami, Pooya Hatami
2020	J	`jnl`	Approximation algorithms for hitting subgraphs. CoRR Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
2020	J	`jnl`	Lower bounds for graph bootstrap percolation via properties of polynomials. J. Comb. Theory A Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian
2020	A	`conf`	Sign Rank vs Discrepancy. CCC Hamed Hatami, Kaave Hosseini, Shachar Lovett
2019	A*	`conf`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman
2019	J	`jnl`	Higher-order Fourier Analysis and Applications. Found. Trends Theor. Comput. Sci. Hamed Hatami, Pooya Hatami, Shachar Lovett
2019	J	`jnl`	Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Algorithmica Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
2019	J	`jnl`	Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Graph properties, graph limits, and entropy. J. Graph Theory Hamed Hatami, Svante Janson, Balázs Szegedy
2018	J	`jnl`	Structure of Protocols for XOR Functions. SIAM J. Comput. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Trading Information Complexity for Error. Theory Comput. Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
2017	Misc	`conf`	Information Complexity of the AND Function in the Two-Party and Multi-party Settings. COCOON Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
2017	J	`jnl`	Information complexity of the AND function in the two-Party, and multiparty settings. CoRR Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
2017	A*	`ed.`	Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 STOC Hamed Hatami, Pierre McKenzie, Valerie King
2017	J	`jnl`	The Unbounded-Error Communication Complexity of symmetric XOR functions. CoRR Hamed Hatami, Yingjie Qian
2017	A	`conf`	Trading Information Complexity for Error. CCC Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
2016	J	`jnl`	A characterization of functions with vanishing averages over products of disjoint sets. Eur. J. Comb. Hamed Hatami, Pooya Hatami, Yaqiao Li
2016	J	`jnl`	On the Additive Bases Problem in Finite Fields. Electron. J. Comb. Victoria de Quehen, Hamed Hatami
2016	A*	`conf`	Structure of Protocols for XOR Functions. FOCS Hamed Hatami, Kaave Hosseini, Shachar Lovett
2016	J	`jnl`	Trading information complexity for error. CoRR Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
2016	J	`jnl`	Trading information complexity for error. Electron. Colloquium Comput. Complex. Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
2014	J	`jnl`	Bounds on the sum of L1 influences. CoRR Yuval Filmus, Hamed Hatami
2014	J	`jnl`	Correlation Testing for Affine Invariant Properties on 픽 SIAM J. Comput. Hamed Hatami, Shachar Lovett
2014	J	`jnl`	General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. Hamed Hatami, Pooya Hatami, Shachar Lovett
2014	J	`jnl`	Limits of Boolean Functions on 𝔽 Electron. J. Comb. Hamed Hatami, Pooya Hatami, James Hirst
2014	J	`jnl`	The inducibility of blow-up graphs. J. Comb. Theory B Hamed Hatami, James Hirst, Serguei Norine
2013	A*	`conf`	Estimating the Distance from Testable Affine-Invariant Properties. FOCS Hamed Hatami, Shachar Lovett
2013	J	`jnl`	Estimating the distance from testable affine-invariant properties. CoRR Hamed Hatami, Shachar Lovett
2013	J	`jnl`	Estimating the distance from testable affine-invariant properties. Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2013	A*	`conf`	Every locally characterized affine-invariant property is testable. STOC Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2013	J	`jnl`	On the number of pentagons in triangle-free graphs. J. Comb. Theory A Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
2013	J	`jnl`	The Entropy of Random-Free Graphons and Properties. Comb. Probab. Comput. Hamed Hatami, Serguei Norine
2012	J	`jnl`	Every locally characterized affine-invariant property is testable CoRR Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	J	`jnl`	Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	J	`jnl`	Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
2012	J	`jnl`	Spectral Norm of Symmetric Functions CoRR Anil Ada, Omar Fawzi, Hamed Hatami
2012	—	`conf`	Spectral Norm of Symmetric Functions. APPROX-RANDOM Anil Ada, Omar Fawzi, Hamed Hatami
2012	J	`jnl`	The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms Hamed Hatami, Michael Molloy
2011	J	`jnl`	Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime CoRR Hamed Hatami, Shachar Lovett
2011	A*	`conf`	Correlation testing for affine invariant properties on F STOC Hamed Hatami, Shachar Lovett
2011	J	`jnl`	Correlation testing for affine invariant properties on F Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2010	J	`jnl`	Higher-order Fourier analysis of F Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2010	—	`—`	On Generalizations of Gowers Norms. Hamed Hatami
2010	A*	`conf`	The Scaling Window for a Random Graph with a Given Degree Sequence. SODA Hamed Hatami, Michael Molloy
2009	J	`jnl`	Decision Trees and Influences of Variables Over Product Probability Spaces. Comb. Probab. Comput. Hamed Hatami
2009	J	`jnl`	The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discret. Math. Hamed Hatami, Xuding Zhu
2008	J	`jnl`	Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. Peyman Afshani, Hamed Hatami
2008	J	`jnl`	Fourier analysis and large independent sets in powers of complete graphs. J. Comb. Theory B Mahya Ghandehari, Hamed Hatami
2008	J	`jnl`	Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l SIAM J. Discret. Math. Hamed Hatami, Avner Magen, Evangelos Markakis
2008	J	`jnl`	Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms Hamed Hatami, Michael Molloy
2007	J	`jnl`	Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions CoRR Peyman Afshani, Hamed Hatami
2007	—	`conf`	Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to APPROX-RANDOM Hamed Hatami, Avner Magen, Evangelos Markakis
2007	J	`jnl`	On the Complexity of the Circular Chromatic Number CoRR Hamed Hatami, Ruzbeh Tusserkani
2007	J	`jnl`	On the Computational Complexity of Defining Sets CoRR Hamed Hatami, Hossein Maserrat
2007	J	`jnl`	Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electron. J. Comb. Hamed Hatami, Pooya Hatami
2006	J	`jnl`	Integrality gaps of semidefinite programs for Vertex Cover and relations to ℓ CoRR Hamed Hatami, Avner Magen, Vangelis Markakis
2005	J	`jnl`	Circular chromatic index of graphs of maximum degree 3. J. Graph Theory Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
2005	J	`jnl`	Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory B Hamed Hatami
2005	J	`jnl`	On the computational complexity of defining sets. Discret. Appl. Math. Hamed Hatami, Hossein Maserrat
2005	J	`jnl`	On the size of the minimum critical set of a Latin square. Discret. Math. Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian
2005	J	`jnl`	Random cubic graphs are not homomorphic to the cycle of size 7. J. Comb. Theory B Hamed Hatami
2004	J	`jnl`	On the complexity of the circular chromatic number. J. Graph Theory Hamed Hatami, Ruzbeh Tusserkani
2004	J	`jnl`	On the spectrum of the forced matching number of graphs. Australas. J Comb. Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
2000	C	`conf`	SharifII Soccer Simulation Team. RoboCup Jafar Habibi, Ehsan Foroughi, Mehran Motamed, Pooya Karimian, Hamed Hatami, Hossein Fardad