default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXin Li 0006
- > Home > Persons > Xin Li 0006
Publications
- 2023
[j6]Kuan Cheng
, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SIAM J. Discret. Math. 37(2): 748-778 (2023)- [j5]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. IEEE Trans. Inf. Theory 69(6): 3574-3589 (2023) - [c42]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC 2023: 14:1-14:25 - [c41]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Applications. COCOON (2) 2023: 184-197 - [c39]Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng:
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. ICALP 2023: 41:1-41:17 - [i64]Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng:
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. CoRR abs/2303.17370 (2023) - [i62]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Applications. CoRR abs/2308.15746 (2023) - [i61]Xin Li, Yu Zheng:
Streaming and Query Once Space Complexity of Longest Increasing Subsequence. CoRR abs/2309.01208 (2023) - [i58]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Application. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors. J. ACM 69(6): 44:1-44:39 (2022) - [j3]Xin Li, Shachar Lovett, Jiapeng Zhang:
Sunflowers and Robust Sunflowers from Randomness Extractors. Theory Comput. 18: 1-18 (2022) - [c38]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract From Local Sources. ICALP 2022: 10:1-10:20 - [c37]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. ITCS 2022: 43:1-43:3 - [i57]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. CoRR abs/2205.13725 (2022) - [i56]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR abs/2209.08688 (2022) - [i55]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c36]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS 2021: 739-750 - [c35]Xin Li, Yu Zheng:
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence. FSTTCS 2021: 27:1-27:23 - [c34]Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng:
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. ICALP 2021: 54:1-54:20 - [c33]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SODA 2021: 1-20 - [c32]Kuan Cheng, Xin Li:
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. SODA 2021: 2424-2443 - [i54]Xin Li, Yu Zheng:
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence. CoRR abs/2103.00713 (2021) - [i53]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR abs/2111.01060 (2021) - [i52]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. CoRR abs/2111.07629 (2021) - 2020
- [j2]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions. SIAM J. Comput. 49(5): 999-1040 (2020) - [c31]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman:
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS 2020: 1226-1242 - [c30]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for adversarial sources via extremal hypergraphs. STOC 2020: 1184-1197 - [c29]Eshan Chattopadhyay, Xin Li:
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. TCC (3) 2020: 584-613 - [i51]Kuan Cheng, Xin Li, Yu Zheng:
Locally Decodable Codes with Randomized Encoding. CoRR abs/2001.03692 (2020) - [i50]Kuan Cheng, Zhengzhong Jin, Xin Li, Yu Zheng:
Space Efficient Deterministic Approximation of String Measures. CoRR abs/2002.08498 (2020) - [i49]Kuan Cheng, Xin Li:
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. CoRR abs/2007.00870 (2020) - [i48]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. CoRR abs/2007.09075 (2020) - [i47]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. Electron. Colloquium Comput. Complex. TR20 (2020) - [i46]Kuan Cheng, Xin Li, Yu Zheng:
Locally Decodable Codes with Randomized Encoding. IACR Cryptol. ePrint Arch. 2020: 31 (2020) - [i45]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. IACR Cryptol. ePrint Arch. 2020: 478 (2020) - 2019
- [c27]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. ICALP 2019: 37:1-37:15 - [c26]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. SODA 2019: 2185-2204 - [i44]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i43]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. IACR Cryptol. ePrint Arch. 2019: 1450 (2019) - 2018
- [c25]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. APPROX-RANDOM 2018: 37:1-37:20 - [c24]Xin Li, Shachar Lovett, Jiapeng Zhang:
Sunflowers and Quasi-Sunflowers from Randomness Extractors. APPROX-RANDOM 2018: 51:1-51:13 - [c23]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A New Approach for Constructing Low-Error, Two-Source Extractors. CCC 2018: 3:1-3:19 - [c22]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. FOCS 2018: 200-211 - [i42]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR abs/1803.03530 (2018) - [i40]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. CoRR abs/1804.05228 (2018) - [i39]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. CoRR abs/1804.05776 (2018) - [i38]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. CoRR abs/1809.00725 (2018) - [i37]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. Electron. Colloquium Comput. Complex. TR18 (2018) - [i36]Xin Li, Shachar Lovett, Jiapeng Zhang:
Sunflowers and Quasi-sunflowers from Randomness Extractors. Electron. Colloquium Comput. Complex. TR18 (2018) - [i34]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More. IACR Cryptol. ePrint Arch. 2018: 1069 (2018) - 2017
- [c20]Eshan Chattopadhyay, Xin Li:
Non-malleable codes and extractors for small-depth circuits, and affine functions. STOC 2017: 1171-1184 - [c19]Kuan Cheng, Yuval Ishai, Xin Li:
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0. TCC (2) 2017: 424-458 - [i33]Kuan Cheng, Xin Li, Ke Wu:
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR abs/1710.07356 (2017) - [i32]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. Electron. Colloquium Comput. Complex. TR17 (2017) - [i31]Kuan Cheng, Yuval Ishai, Xin Li:
Near-Optimal Secret Sharing and Error Correcting Codes in AC0. IACR Cryptol. ePrint Arch. 2017: 927 (2017) - 2016
- [c17]Eshan Chattopadhyay, Xin Li:
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols. FOCS 2016: 158-167 - [c15]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-malleable extractors and codes, with their many tampered extensions. STOC 2016: 285-298 - [c14]Eshan Chattopadhyay, Xin Li:
Extractors for sumset sources. STOC 2016: 299-311 - [i30]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. CoRR abs/1602.01530 (2016) - [i28]Eshan Chattopadhyay, Xin Li:
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. CoRR abs/1603.05226 (2016) - [i26]Eshan Chattopadhyay, Xin Li:
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. Electron. Colloquium Comput. Complex. TR16 (2016) - [i25]Eshan Chattopadhyay, Xin Li:
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions. Electron. Colloquium Comput. Complex. TR16 (2016) - [i24]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. Electron. Colloquium Comput. Complex. TR16 (2016) - [i22]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. IACR Cryptol. ePrint Arch. 2016: 340 (2016) - 2015
- [i20]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. CoRR abs/1505.00107 (2015) - [i18]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i17]Eshan Chattopadhyay, Xin Li:
Extractors for Sumset Sources. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman:
Privacy Amplification and Nonmalleable Extractors Via Character Sums. SIAM J. Comput. 43(2): 800-830 (2014) - [i13]Kai-Min Chung, Xin Li, Xiaodi Wu:
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications. CoRR abs/1411.2315 (2014) - [i12]Kai-Min Chung, Xin Li, Xiaodi Wu:
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c10]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. ICALP (1) 2013: 576-588 - [i11]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR13 (2013) - [i9]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2013: 671 (2013) - 2011
- [c4]Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman:
Privacy Amplification and Non-malleable Extractors via Character Sums. FOCS 2011: 668-677 - 2009
- [c3]Yael Tauman Kalai, Xin Li, Anup Rao:
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. FOCS 2009: 617-626 - 2008
- [c2]Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman:
Network Extractor Protocols. FOCS 2008: 654-663
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-09-19 00:32 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:
