A Speaker Tracking Algorithm Based on Audio and Visual Information Fusion Using Particle Filter. - Xin Li 006; Luo Sun; Linmi Tao; Guangyou Xu; Ying Jia (ICIAR (2), 2004)

Network Extractor Protocols. - Yael Tauman Kalai; Xin Li 006; Anup Rao 001; David Zuckerman (FOCS, 2008)

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. - Yael Tauman Kalai; Xin Li 006; Anup Rao 001 (FOCS, 2009)

On the Problem of Local Randomness in Privacy Amplification with an Active Adversary - Xin Li 006 (CoRR, 2010)

A New Approach to Affine Extractors and Dispersers. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2010)

Improved Constructions of Three Source Extractors. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2010)

Privacy Amplification and Non-malleable Extractors via Character Sums. - Yevgeniy Dodis; Xin Li 006; Trevor D. Wooley; David Zuckerman (FOCS, 2011)

Design Extractors, Non-Malleable Condensers and Privacy Amplification. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2011)

Non-Malleable Extractors for Entropy Rate <1/2. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2011)

New Independent Source Extractors with Exponential Improvement. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2012)

Non-Malleable Extractors, Two-Source Extractors and Privacy Amplification. - Xin Li 006 (IACR Cryptol. ePrint Arch., 2012)

Robust Pseudorandom Generators. - Yuval Ishai; Eyal Kushilevitz; Xin Li 006; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; David Zuckerman (Electron. Colloquium Comput. Complex., 2013)

Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2013)

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications. - Kai-Min Chung; Xin Li 006; Xiaodi Wu 001 (Electron. Colloquium Comput. Complex., 2014)

Privacy Amplification and Nonmalleable Extractors Via Character Sums. - Yevgeniy Dodis; Xin Li 006; Trevor D. Wooley; David Zuckerman (SIAM J. Comput., 2014)

Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification. - Xin Li 006 (TCC (1), 2015)

Non-Malleable Extractors and Codes, with their Many Tampered Extensions. - Eshan Chattopadhyay; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Extractors for Sumset Sources. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Three-Source Extractors for Polylogarithmic Min-Entropy. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Extractors for Affine Sources with Polylogarithmic Entropy. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Improved Constructions of Two-Source Extractors. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2015)

Computing Approximate PSD Factorizations. - Amitabh Basu; Michael Dinitz; Xin Li 006 (APPROX-RANDOM, 2016)

Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy. - Xin Li 006 (FOCS, 2016)

Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

Randomness Extraction in AC0 and with Small Locality. - Kuan Cheng; Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

Improved Non-Malleable Extractors, Non-Malleable Codes and Independent Source Extractors. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2016)

Near-Optimal Secret Sharing and Error Correcting Codes in mathsf AC^0 AC 0. - Kuan Cheng; Yuval Ishai; Xin Li 006 (TCC (2), 2017)

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. - Kuan Cheng; Xin Li 006; Ke Wu 001 (CoRR, 2017)

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

Near-Optimal Secret Sharing and Error Correcting Codes in AC0. - Kuan Cheng; Yuval Ishai; Xin Li 006 (IACR Cryptol. ePrint Arch., 2017)

Randomness Extraction in AC0 and with Small Locality. - Kuan Cheng; Xin Li 006 (APPROX-RANDOM, 2018)

A New Approach for Constructing Low-Error, Two-Source Extractors. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (CCC, 2018)

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. - Kuan Cheng; Bernhard Haeupler; Xin Li 006; Amirbehshad Shahrasbi; Ke Wu 001 (CoRR, 2018)

Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. - Kuan Cheng; Zhengzhong Jin; Xin Li 006; Ke Wu 001 (CoRR, 2018)

Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. - Eshan Chattopadhyay; Xin Li 006 (Electron. Colloquium Comput. Complex., 2018)

Sunflowers and Quasi-sunflowers from Randomness Extractors. - Xin Li 006; Shachar Lovett; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More. - Eshan Chattopadhyay; Xin Li 006 (IACR Cryptol. ePrint Arch., 2018)

Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions. - Xin Li 006 (IACR Cryptol. ePrint Arch., 2018)

Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. - Kuan Cheng; Zhengzhong Jin; Xin Li 006; Ke Wu 001 (ICALP, 2019)

Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. - Kuan Cheng; Bernhard Haeupler; Xin Li 006; Amirbehshad Shahrasbi; Ke Wu 001 (SODA, 2019)

Extractors for Adversarial Sources via Extremal Hypergraphs. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2019)

Extractors and Secret Sharing Against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Ashutosh Kumar 002; Xin Li 006; Raghu Meka; David Zuckerman (FOCS, 2020)

Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. - Eshan Chattopadhyay; Xin Li 006 (TCC (3), 2020)

Space Efficient Deterministic Approximation of String Measures. - Kuan Cheng; Zhengzhong Jin; Xin Li 006; Yu Zheng 014 (CoRR, 2020)

Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Xin Li 006 (Electron. Colloquium Comput. Complex., 2020)

Locally Decodable Codes with Randomized Encoding. - Kuan Cheng; Xin Li 006; Yu Zheng 014 (IACR Cryptol. ePrint Arch., 2020)

Nonmalleable Extractors and Codes, with Their Many Tampered Extensions. - Eshan Chattopadhyay; Vipul Goyal; Xin Li 006 (SIAM J. Comput., 2020)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. - Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (FOCS, 2021)

Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence. - Xin Li 006; Yu Zheng 014 (FSTTCS, 2021)

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. - Kuan Cheng; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Zhengzhong Jin; Xin Li 006; Aviad Rubinstein; Saeed Seddighin; Yu Zheng 014 (ICALP, 2021)

Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. - Kuan Cheng; Xin Li 006 (SODA, 2021)

Low-Degree Polynomials Extract from Local Sources. - Omar Alrabiah; Eshan Chattopadhyay; Jesse Goodman; Xin Li 006; João Ribeiro 002 (Electron. Colloquium Comput. Complex., 2022)

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors. - Kuan Cheng; Zhengzhong Jin; Xin Li 006; Ke Wu 001 (J. ACM, 2022)

Sunflowers and Robust Sunflowers from Randomness Extractors. - Xin Li 006; Shachar Lovett; Jiapeng Zhang (Adv. Math. Commun., 2022)

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. - Alexander R. Block; Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (CCC, 2023)

Random Shortening of Linear Codes and Applications. - Xue Chen; Kuan Cheng; Xin Li 006; Songtao Mao (COCOON (2), 2023)

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. - Kuan Cheng; Zhengzhong Jin; Xin Li 006; Zhide Wei; Yu Zheng 014 (ICALP, 2023)

Streaming and Query Once Space Complexity of Longest Increasing Subsequence. - Xin Li 006; Yu Zheng 014 (CoRR, 2023)

Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More. - Xin Li 006 (Electron. Colloquium Comput. Complex., 2023)

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs. - Xin Li 006; Yan Zhong 002 (Electron. Colloquium Comput. Complex., 2023)

Random Shortening of Linear Codes and Application. - Xue Chen; Kuan Cheng; Xin Li 006; Songtao Mao (Electron. Colloquium Comput. Complex., 2023)

Efficient Linear and Affine Codes for Correcting Insertions/Deletions. - Kuan Cheng; Venkatesan Guruswami; Bernhard Haeupler; Xin Li 006 (SIAM J. Discret. Math., 2023)

Improved Decoding of Expander Codes. - Xue Chen; Kuan Cheng; Xin Li 006; Minghui Ouyang (IEEE Trans. Inf. Theory, 2023)

Two-Source and Affine Non-Malleable Extractors for Small Entropy. - Xin Li 006; Yan Zhong 002 (ICALP, 2024)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes. - Xin Li 006; Songtao Mao (Electron. Colloquium Comput. Complex., 2024)

Improved Condensers for Chor-Goldreich Sources. - Jesse Goodman; Xin Li 006; David Zuckerman (Electron. Colloquium Comput. Complex., 2024)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. - Kuan Cheng; Elena Grigorescu; Xin Li 006; Madhu Sudan 001; Minshen Zhu (IEEE Trans. Inf. Theory, 2025)