| Structure of protocols for XOR functions H Hatami, K Hosseini, S Lovett SIAM Journal on Computing 47 (1), 208-217, 2018 | 71 | 2018 |
| Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019 | 65 | 2019 |
| 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 | 12 | 2016 |
| 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 | 11 | 2020 |
| Optimality of linear sketching under modular updates K Hosseini, S Lovett, G Yaroslavtsev arXiv preprint arXiv:1809.09063, 2018 | 11 | 2018 |
| 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 | 11 | 2016 |
| A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds K Hosseini, S Lovett arXiv preprint arXiv:1808.04965, 2018 | 10 | 2018 |
| 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 | 9 | 2023 |
| Separation of the factorization norm and randomized communication complexity TM Cheung, H Hatami, K Hosseini, M Shirley 38th Computational Complexity Conference (CCC 2023), 1: 1-1: 16, 2023 | 9 | 2023 |
| Sign rank vs discrepancy H Hatami, K Hosseini, S Lovett 35th Computational Complexity Conference (CCC 2020), 18: 1-18: 14, 2020 | 9 | 2020 |
| Torus polynomials: An algebraic approach to ACC lower bounds A Bhrushundi, K Hosseini, S Lovett, S Rao arXiv preprint arXiv:1804.08176, 2018 | 8 | 2018 |
| 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 | 4 | 2024 |
| Online learning and disambiguations of partial concept classes TM Cheung, H Hatami, P Hatami, K Hosseini arXiv preprint arXiv:2303.17578, 2023 | 4 | 2023 |
| 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 | 2 | 2024 |
| On the structure of the spectrum of small sets K Hosseini, S Lovett Journal of Combinatorial Theory, Series A 148, 1-14, 2017 | 2 | 2017 |
| A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications TM Cheung, H Hatami, K Hosseini, A Nikolov, T Pitassi, M Shirley 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 37 …, 2025 | 1 | 2025 |
| Refuting approaches to the log-rank conjecture for XOR functions H Hatami, K Hosseini, S Lovett, A Ostuni arXiv preprint arXiv:2312.09400, 2023 | 1 | 2023 |
| Structure of protocols for XOR functions K Hosseini, S Lovett Electronic Colloquium on Computational Complexity (ECCC) 23, 44, 2016 | 1 | 2016 |
| 34th Computational Complexity Conference (CCC 2019) B Rossman, NH Bshouty, A Bhangale, S Khot, E Chattopadhyay, A De, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |
| LIPIcs, Volume 102, CCC'18, Complete Volume}} RA Servedio, E Chattopadhyay, P Hatami, K Hosseini, S Lovett, D Kane, ... 33rd Computational Complexity Conference (CCC 2018) 102, 0, 2018 | | 2018 |
