default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXin Lyu 0002
Person information
- affiliation: Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China
Other persons with the same name
- Xin Lyu — disambiguation page
- Xin Lyu 0001
![[0000-0003-1862-2070]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-1862-2070")
— Hohai University, Nanjing, China - Xin Lyu 0003 — University of California at Berkeley, CA, USA
- Xin Lyu 0004 — Communication University of China, Beijing, China
- Xin Lyu 0005 — Beijing Normal University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. COLT 2024: 1200-1222- [c12]Xin Lyu, Hongxun Wu, Junzhao Yang:
The Cost of Parallelizing Boosting. SODA 2024: 3140-3155 - [i14]Xin Lyu, Hongxun Wu, Junzhao Yang:
The Cost of Parallelizing Boosting. CoRR abs/2402.15145 (2024) - [i13]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. CoRR abs/2403.00028 (2024) - [i12]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. IACR Cryptol. ePrint Arch. 2024: 373 (2024) - 2023
- [c11]Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang:
Tight Time-Space Lower Bounds for Constant-Pass Learning. FOCS 2023: 1195-1202 - [c10]Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS 2023: 1224-1239 - [c9]Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu:
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP 2023: 39:1-39:20 - [c8]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. ITCS 2023: 39:1-39:23 - [c7]Edith Cohen, Xin Lyu:
The Target-Charging Technique for Privacy Analysis across Interactive Computations. NeurIPS 2023 - [c6]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. STOC 2023: 472-482 - [i11]Edith Cohen, Xin Lyu:
The Target-Charging Technique for Privacy Accounting across Interactive Computations. CoRR abs/2302.11044 (2023) - [i10]Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang:
Tight Time-Space Lower Bounds for Constant-Pass Learning. CoRR abs/2310.08070 (2023) - [i9]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Hot PATE: Private Aggregation of Distributions for Diverse Task. CoRR abs/2312.02132 (2023) - [i8]Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c5]Xin Lyu:
Improved Pseudorandom Generators for AC⁰ Circuits. CCC 2022: 34:1-34:25 - [c4]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. ICML 2022: 4112-4140 - [i7]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. CoRR abs/2202.13736 (2022) - [i6]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. CoRR abs/2211.06387 (2022) - [i5]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. CoRR abs/2211.12063 (2022) - [i4]Xin Lyu:
Improved Pseudorandom Generators for AC0 Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c3]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. ICALP 2021: 51:1-51:20 - [c2]Lijie Chen, Xin Lyu:
Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. STOC 2021: 761-771 - [i3]Lijie Chen, Xin Lyu:
Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. Electron. Colloquium Comput. Complex. TR21 (2021) - [i2]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c1]Lijie Chen, Xin Lyu, R. Ryan Williams:
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. FOCS 2020: 1-12 - [i1]Lijie Chen, Xin Lyu, Ryan Williams:
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. Electron. Colloquium Comput. Complex. TR20 (2020)
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-12-23 20:30 CET 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:
