default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaave Hosseini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP 2024: 82:1-82:11- 2023
- [c10]Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini
, Morgan Shirley:
Separation of the Factorization Norm and Randomized Communication Complexity. CCC 2023: 1:1-1:16 - [c9]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. ICALP 2023: 42:1-42:13 - [c8]Hamed Hatami, Kaave Hosseini, Xiang Meng:
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC 2023: 463-471 - [i16]TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
Online Learning and Disambiguations of Partial Concept Classes. CoRR abs/2303.17578 (2023) - [i15]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting approaches to the log-rank conjecture for XOR functions. CoRR abs/2312.09400 (2023) - [i14]Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]Kaave Hosseini, Hamed Hatami, Shachar Lovett:
Sign-Rank vs. Discrepancy. Theory Comput. 18: 1-22 (2022) - [i13]TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Hamed Hatami, Kaave Hosseini, Xiang Meng:
A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [c7]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Sign Rank vs Discrepancy. CCC 2020: 18:1-18:14 - [c6]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman:
XOR lemmas for resilient functions against polynomials. STOC 2020: 234-246
2010 – 2019
- 2019
- [b1]Kaave Hosseini:
Structure and Randomness in Complexity Theory and Additive Combinatorics. University of California, San Diego, USA, 2019 - [j3]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. Theory Comput. 15: 1-26 (2019) - [c5]Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching Under Modular Updates. CCC 2019: 13:1-13:17 - [c4]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS 2019: 13:1-13:16 - [i11]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman:
XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - [i10]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j2]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Structure of Protocols for XOR Functions. SIAM J. Comput. 47(1): 208-217 (2018) - [c3]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. CCC 2018: 1:1-1:21 - [i9]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus polynomials: an algebraic approach to ACC lower bounds. CoRR abs/1804.08176 (2018) - [i8]Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching under Modular Updates. CoRR abs/1809.09063 (2018) - [i7]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus polynomials: an algebraic approach to ACC lower bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - [i6]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. TR18 (2018) - [i5]Kaave Hosseini, Shachar Lovett:
A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - [i4]Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching under Modular Updates. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j1]Kaave Hosseini, Shachar Lovett:
On the structure of the spectrum of small sets. J. Comb. Theory A 148: 1-14 (2017) - 2016
- [c2]Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Structure of Protocols for XOR Functions. FOCS 2016: 282-288 - [c1]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable extractors, spectrum doubling, and application to privacy amplification. ISIT 2016: 2913-2917 - [i3]Kaave Hosseini, Shachar Lovett:
Structure of protocols for XOR functions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. Electron. Colloquium Comput. Complex. TR15 (2015) - [i1]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. IACR Cryptol. ePrint Arch. 2015: 1094 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
