Follow
Kaave Hosseini
Title
Cited by
Cited by
Year
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
692018
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
612019
XOR lemmas for resilient functions against polynomials
E Chattopadhyay, P Hatami, K Hosseini, S Lovett, D Zuckerman
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
122020
Affine-malleable extractors, spectrum doubling, and application to privacy amplification
D Aggarwal, K Hosseini, S Lovett
2016 IEEE International Symposium on Information Theory (ISIT), 2913-2917, 2016
122016
Optimality of linear sketching under modular updates
K Hosseini, S Lovett, G Yaroslavtsev
arXiv preprint arXiv:1809.09063, 2018
112018
A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds
K Hosseini, S Lovett
arXiv preprint arXiv:1808.04965, 2018
92018
An improved lower bound for arithmetic regularity
K Hosseini, S Lovett, G Moshkovitz, A Shapira
Mathematical Proceedings of the Cambridge Philosophical Society 161 (2), 193-197, 2016
92016
Sign rank vs discrepancy
H Hatami, K Hosseini, S Lovett
35th Computational Complexity Conference (CCC 2020), 2020
82020
A Borsuk-Ulam lower bound for sign-rank and its applications
H Hatami, K Hosseini, X Meng
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 463-471, 2023
72023
Separation of the factorization norm and randomized communication complexity
TM Cheung, H Hatami, K Hosseini, M Shirley
38th Computational Complexity Conference (CCC 2023), 2023
72023
Torus polynomials: An algebraic approach to ACC lower bounds
A Bhrushundi, K Hosseini, S Lovett, S Rao
arXiv preprint arXiv:1804.08176, 2018
72018
Online Learning and Disambiguations of Partial Concept Classes
TM Cheung, H Hatami, P Hatami, K Hosseini
arXiv preprint arXiv:2303.17578, 2023
32023
Sign-rank vs. discrepancy
K Hosseini, H Hatami, S Lovett
Theory of Computing 18 (1), 1-22, 2022
32022
Sparse graph counting and kelley-meka bounds for binary systems
Y Filmus, H Hatami, K Hosseini, E Kelman
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
22024
Parallel Loop Locality Analysis for Symbolic Thread Counts
F Liu, Y Zhu, S Sun, C Ding, W Smith, KS Hosseini
Proceedings of the 2024 International Conference on Parallel Architectures …, 2024
22024
On the structure of the spectrum of small sets
K Hosseini, S Lovett
Journal of Combinatorial Theory, Series A 148, 1-14, 2017
22017
Refuting approaches to the log-rank conjecture for XOR functions
H Hatami, K Hosseini, S Lovett, A Ostuni
arXiv preprint arXiv:2312.09400, 2023
12023
Structure of protocols for XOR functions
K Hosseini, S Lovett
Electronic Colloquium on Computational Complexity (ECCC) 23, 44, 2016
12016
A generalization of the Kelley--Meka theorem to binary systems of linear forms
Y Filmus, H Hatami, K Hosseini, E Kelman
arXiv preprint arXiv:2311.12248, 2023
2023
10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
S Agrawal, M Shadravan, C Stein, D Aharonov, L Zhou, A Andoni, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20