Hamed Hatami

Malayer University — IR

Mathematics · Physical Sciences

17h-index1.2kcitations136works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Limits and Structures in Graph Theory(52), Advanced Graph Theory Research(44), Complexity and Algorithms in Graphs(33), graph theory and CDMA systems(19), Graph theory and applications(17)

Publications136 total

Optical properties of CdPbSe thin films: effects of deposition process and alloy composition
Optical and Quantum Electronics·2025
Block Complexity and Idempotent Schur Multipliers
International Mathematics Research Notices·2025· 1 citedOpen Access
Simplicial Covering Dimension of Extremal Concept Classes
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2025Open Access
Separation of the Factorization Norm and Randomized Communication Complexity
Computational Complexity·2025Open Access
Optical Properties of CdPbSe Thin Films: Effects of Deposition Process and Alloy Composition
2025Open Access
Block structure in boolean matrices of bounded factorization norm
arXiv (Cornell University)·2025Open Access
Block complexity and idempotent Schur multipliers
arXiv (Cornell University)·2025Open Access
Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
arXiv (Cornell University)·2025Open Access
A tight lower bound on non-adaptive group testing estimation
Discrete Applied Mathematics·2025
Stability and List-Replicability for Agnostic Learners
arXiv (Cornell University)·2025Open Access
Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems
2024· 1 cited
Boolean Functions with Small Approximate Spectral Norm
arXiv (Cornell University)·2024· 1 citedOpen Access
Typical structure of hereditary properties of binary matroids
Journal of Combinatorial Theory Series B·2024· 1 cited
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes
ACM SIGACT News·2024· 4 cited
Structure in Communication Complexity and Constant-Cost Complexity Classes
arXiv (Cornell University)·2024Open Access
Tight Lower Bounds on Non-Adaptive Group Testing Estimation
SSRN Electronic Journal·2024Open Access
Refuting Approaches to the Log-Rank Conjecture for XOR Functions
arXiv (Cornell University)·2023Open Access
Sparse graph counting and Kelley-Meka bounds for binary systems
arXiv (Cornell University)·2023Open Access
A tight lower bound on non-adaptive group testing estimation
arXiv (Cornell University)·2023· 2 citedOpen Access
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications
2023· 2 cited
page 1 of 7Next →

Frequent Co-authors

Shachar Lovett(8), Pooya Hatami(6), Mahya Ghandehari(5), Serguei Norine(4), Balázs Szegedy(4), Ruzbeh Tusserkani(4), Lianna Hambardzumyan(4), Michael Molloy(3), Davood Taherinia(3), Farshad Mirzaee Valadi(3), Xuding Zhu(3), Peyman Afshani(3), Yuval Filmus(3), Jan Hladký(2), Daniel Král͏̌(2), Alexander Razborov(2), László Lovász(2), James Hirst(2), Kaave Hosseini(2), Ghandehari Mahsa(2)