Kaave Hosseini

Orcid: 0000-0002-3497-3500

According to our database1, Kaave Hosseini authored at least 16 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Refuting approaches to the log-rank conjecture for XOR functions.
Electron. Colloquium Comput. Complex., 2023

A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Online Learning and Disambiguations of Partial Concept Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Sign-Rank vs. Discrepancy.
Theory Comput., 2022

A Borsuk-Ulam lower bound for sign-rank and its application.
Electron. Colloquium Comput. Complex., 2022

Separation of the factorization norm and randomized communication complexity.
Electron. Colloquium Comput. Complex., 2022

2019
Structure and Randomness in Complexity Theory and Additive Combinatorics.
PhD thesis, 2019

Pseudorandom Generators from Polarizing Random Walks.
Theory Comput., 2019

XOR Lemmas for Resilient Functions Against Polynomials.
Electron. Colloquium Comput. Complex., 2019

2018
Structure of Protocols for XOR Functions.
SIAM J. Comput., 2018

Optimality of Linear Sketching under Modular Updates.
Electron. Colloquium Comput. Complex., 2018

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds.
Electron. Colloquium Comput. Complex., 2018

Torus polynomials: an algebraic approach to ACC lower bounds.
Electron. Colloquium Comput. Complex., 2018

2017
On the structure of the spectrum of small sets.
J. Comb. Theory, Ser. A, 2017

2016
Structure of protocols for XOR functions.
Electron. Colloquium Comput. Complex., 2016

2015
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification.
Electron. Colloquium Comput. Complex., 2015


  Loading...