Kaave Hosseini

36 papers A* 6A 6B 1Journal 22

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications. ITCS Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2025	J	`jnl`	Separation of the Factorization Norm and Randomized Communication Complexity. Comput. Complex. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2024	J	`jnl`	A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. Electron. Colloquium Comput. Complex. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley
2024	A*	`conf`	Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2024	A*	`conf`	Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. FOCS Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman
2023	A*	`conf`	A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC Hamed Hatami, Kaave Hosseini, Xiang Meng
2023	A*	`conf`	Online Learning and Disambiguations of Partial Concept Classes. ICALP TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
2023	J	`jnl`	Online Learning and Disambiguations of Partial Concept Classes. CoRR TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. CoRR Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	A	`conf`	Separation of the Factorization Norm and Randomized Communication Complexity. CCC Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2022	J	`jnl`	A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Xiang Meng
2022	J	`jnl`	Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley
2022	J	`jnl`	Sign-Rank vs. Discrepancy. Theory Comput. Kaave Hosseini, Hamed Hatami, Shachar Lovett
2020	A	`conf`	Sign Rank vs Discrepancy. CCC Hamed Hatami, Kaave Hosseini, Shachar Lovett
2020	A*	`conf`	XOR lemmas for resilient functions against polynomials. STOC Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2019	A	`conf`	Optimality of Linear Sketching Under Modular Updates. CCC Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2019	J	`jnl`	Pseudorandom Generators from Polarizing Random Walks. Theory Comput. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2019	J	`jnl`	Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2019	—	`—`	Structure and Randomness in Complexity Theory and Additive Combinatorics. Kaave Hosseini
2019	A	`conf`	Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2019	J	`jnl`	XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2018	J	`jnl`	A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Optimality of Linear Sketching under Modular Updates. CoRR Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2018	J	`jnl`	Optimality of Linear Sketching under Modular Updates. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2018	A	`conf`	Pseudorandom Generators from Polarizing Random Walks. CCC Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Structure of Protocols for XOR Functions. SIAM J. Comput. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Torus polynomials: an algebraic approach to ACC lower bounds. CoRR Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2018	J	`jnl`	Torus polynomials: an algebraic approach to ACC lower bounds. Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2017	J	`jnl`	On the structure of the spectrum of small sets. J. Comb. Theory A Kaave Hosseini, Shachar Lovett
2016	B	`conf`	Affine-malleable extractors, spectrum doubling, and application to privacy amplification. ISIT Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2016	A*	`conf`	Structure of Protocols for XOR Functions. FOCS Hamed Hatami, Kaave Hosseini, Shachar Lovett
2016	J	`jnl`	Structure of protocols for XOR functions. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett
2015	J	`jnl`	Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. Electron. Colloquium Comput. Complex. Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2015	J	`jnl`	Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. IACR Cryptol. ePrint Arch. Divesh Aggarwal, Kaave Hosseini, Shachar Lovett