Kaave Hosseini

Most-cited papers

Pseudorandom Generators from Polarizing Random Walks
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018Electron. Colloquium Comput. Complex.66 citations Open access
Semantic Scholar
Structure of Protocols for XOR Functions
Hamed Hatami, Kaave Hosseini, Shachar Lovett
2016IEEE Annual Symposium on Foundations of Computer Science62 citations Open access
Semantic Scholar
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications
Hamed Hatami, Kaave Hosseini, Xiangju Meng
2023Symposium on the Theory of Computing15 citations Open access
Semantic Scholar
XOR lemmas for resilient functions against polynomials
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett +1 more
2020Electron. Colloquium Comput. Complex.15 citations
Semantic Scholar
Sign rank vs discrepancy
Hamed Hatami, Kaave Hosseini, Shachar Lovett
2020Electron. Colloquium Comput. Complex.15 citations
Semantic Scholar
Optimality of linear sketching under modular updates
Kaave Hosseini, Shachar Lovett, G. Yaroslavtsev
2018Electron. Colloquium Comput. Complex.14 citations
Semantic Scholar
Separation of the Factorization Norm and Randomized Communication Complexity
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, M. Shirley
2025Computational Complexity13 citations
Semantic Scholar
Torus polynomials: an algebraic approach to ACC lower bounds
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2018Electron. Colloquium Comput. Complex.13 citations
Semantic Scholar
An improved lower bound for arithmetic regularity
Kaave Hosseini, Shachar Lovett, Guy Moshkovitz, A. Shapira
2014Mathematical Proceedings of the Cambridge Philosophical Society13 citations Open access
Semantic Scholar
A Lower Bound on the Trace Norm of Boolean Matrices and its Applications
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov +2 more
2026Algorithmica11 citations Open access
Semantic Scholar
A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds
Kaave Hosseini, Shachar Lovett
2018Electron. Colloquium Comput. Complex.10 citations
Semantic Scholar
Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems
Yuval Filmus, Hamed Hatami, Kaave Hosseini, E. Kelman
2023IEEE Annual Symposium on Foundations of Computer Science8 citations Open access
Semantic Scholar
Affine-malleable extractors, spectrum doubling, and application to privacy amplification
Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2016International Symposium on Information Theory8 citations Open access
Semantic Scholar
Online Learning and Disambiguations of Partial Concept Classes
Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
2023International Colloquium on Automata, Languages and Programming7 citations Open access
Semantic Scholar
Parallel Loop Locality Analysis for Symbolic Thread Counts
Fangzhou Liu, Yifan Zhu, Shaotong Sun, Chen Ding +2 more
2024International Conference on Parallel Architectures and Compilation Techniques3 citations Open access
Semantic Scholar
Refuting approaches to the log-rank conjecture for XOR functions
Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023Electron. Colloquium Comput. Complex.3 citations
Semantic Scholar
A ℤ2-Topological Framework for Sign-rank Lower Bounds
Florian Frick, Kaave Hosseini, A. Vasileuski
2026Electron. Colloquium Comput. Complex.2 citations
Semantic Scholar
Condensing Hardness in Boolean Functions
G. Hart, Kaave Hosseini, A. Iosevich
2 citations
Semantic Scholar
Superpolynomial lower bounds for vertex numbers of real projective space triangulations via a topological Figiel-Lindenstrauss-Milman theorem
Florian Frick, Kaave Hosseini, Eric Myzelev, Arya Narnapatti +1 more
20261 citations
Semantic Scholar
A Borsuk-Ulam lower bound for sign-rank and its application
Hamed Hatami, Kaave Hosseini, Xiang-wu Meng
2022Electron. Colloquium Comput. Complex.1 citations
Semantic Scholar
33rd Computational Complexity Conference, CCC 2018, San Diego, CA, USA, June 22-24, 2018
Rocco Servedio, Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
2018Cybersecurity and Cyberforensics Conference1 citations
Semantic Scholar
On the structure of the spectrum of small sets
Kaave Hosseini, Shachar Lovett
2015Journal of Combinatorial Theory1 citations Open access
Semantic Scholar
A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
Florian Frick, Kaave Hosseini, A. Vasileuski
20260 citations
Semantic Scholar
Structure and Randomness in Complexity Theory and Additive Combinatorics
Kaave Hosseini
20190 citations
Semantic Scholar
2 Fractional PRG as steps in a random walk
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
20180 citations
Semantic Scholar
Algebraic Complexity Approach to Sign-Rank
M. Oos, Kaave Hosseini, Valentin Imbach, A. Sofronova
0 citations
Semantic Scholar