Kaave Hosseini

According to our database, Kaave Hosseini authored at least 19 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications.

Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Refuting Approaches to the Log-Rank Conjecture for XOR Functions.

Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems.

Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Parallel Loop Locality Analysis for Symbolic Thread Counts.

Fangzhou Liu, Yifan Zhu, Shaotong Sun, Chen Ding, Wesley Smith, Kaave Seyed Hosseini

Proceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques, 2024

2023

A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications.

Hamed Hatami, Kaave Hosseini, Xiang Meng

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Online Learning and Disambiguations of Partial Concept Classes.

TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Separation of the Factorization Norm and Randomized Communication Complexity.

Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley

Proceedings of the 38th Computational Complexity Conference, 2023

2022

A Borsuk-Ulam lower bound for sign-rank and its application.

Hamed Hatami, Kaave Hosseini, Xiang Meng

Electron. Colloquium Comput. Complex., 2022

2020

XOR lemmas for resilient functions against polynomials.

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Sign Rank vs Discrepancy.

Hamed Hatami, Kaave Hosseini, Shachar Lovett

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Structure and Randomness in Complexity Theory and Additive Combinatorics.

Kaave Hosseini

PhD thesis, 2019

Torus Polynomials: An Algebraic Approach to ACC Lower Bounds.

Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Optimality of Linear Sketching Under Modular Updates.

Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev

Proceedings of the 34th Computational Complexity Conference, 2019

2018

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds.

Kaave Hosseini, Shachar Lovett

Electron. Colloquium Comput. Complex., 2018

Pseudorandom Generators from Polarizing Random Walks.

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

On the structure of the spectrum of small sets.

Kaave Hosseini, Shachar Lovett

J. Comb. Theory A, 2017

2016

Structure of protocols for XOR functions.

Kaave Hosseini, Shachar Lovett

Electron. Colloquium Comput. Complex., 2016

Affine-malleable extractors, spectrum doubling, and application to privacy amplification.

Divesh Aggarwal, Kaave Hosseini, Shachar Lovett

Proceedings of the IEEE International Symposium on Information Theory, 2016

Structure of Protocols for XOR Functions.

Hamed Hatami, Kaave Hosseini, Shachar Lovett

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016