Some Improved Complexity Results for uSVP and GapSVP. - Kuan Cheng (IACR Cryptol. ePrint Arch., 2013)

Pseudorandom Generator Based on Hard Lattice Problem. - Kuan Cheng (IACR Cryptol. ePrint Arch., 2014)

Randomness Extraction in AC0 and with Small Locality. - Kuan Cheng; 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)

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

Cold Centering Algorithm on Pipe Based on Laser Measurement. - Yongbo Li; Xiandong Yin; Weiling Liu; Yafeng Liu; Weihan Gou; Kuan Cheng (J. Adv. Comput. Intell. Intell. Informatics, 2017)

Randomness Extraction in AC0 and with Small Locality. - Kuan Cheng; Xin Li 006 (APPROX-RANDOM, 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)

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)

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

Hitting Sets Give Two-Sided Derandomization of Small Space. - Kuan Cheng; William Hoza (Electron. Colloquium Comput. Complex., 2020)

Locally Decodable Codes with Randomized Encoding. - Kuan Cheng; Xin Li 006; Yu Zheng 014 (IACR Cryptol. ePrint Arch., 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)

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)

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)

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)

On The Relative Error of Random Fourier Features for Preserving Kernel Distance. - Kuan Cheng; Shaofeng H.-C. Jiang; Luojian Wei; Zhide Wei (ICLR, 2023)

Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (CoRR, 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)

When Can an Expander Code Correct Ω(n) Errors in O(n) Time? - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (APPROX/RANDOM, 2024)

Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors. - Kuan Cheng; Ruiyang Wu 002 (APPROX/RANDOM, 2024)

BPL ⊆ L-AC¹. - Kuan Cheng; Yichuan Wang (CCC, 2024)

FreeKD: Knowledge Distillation via Semantic Frequency Prompt. - Yuan Zhang 020; Tao Huang 020; Jiaming Liu 003; Tao Jiang; Kuan Cheng; Shanghang Zhang (CVPR, 2024)

Unveiling the Tapestry of Consistency in Large Vision-Language Models. - Yuan Zhang 020; Fei Xiao; Tao Huang 020; Chun-Kai Fan; Hongyuan Dong; Jiawen Li 006; Jiacong Wang; Kuan Cheng; Shanghang Zhang; Haoyuan Guo (NeurIPS, 2024)

SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference. - Yuan Zhang 020; Chun-Kai Fan; Junpeng Ma; Wenzhao Zheng; Tao Huang 020; Kuan Cheng; Denis A. Gudovskiy; Tomoyuki Okuno; Yohei Nakata; Kurt Keutzer; Shanghang Zhang (CoRR, 2024)

Randomness Extractors in $ mathrm{AC}^0$ and $ mathrm{NC}^1$: Optimal up to Constant Factors. - Kuan Cheng; Ruiyang Wu 002 (Electron. Colloquium Comput. Complex., 2024)

$BPL subseteq L-AC^1$. - Kuan Cheng; Yichuan Wang (Electron. Colloquium Comput. Complex., 2024)

Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions. - Kuan Cheng; Ruiyang Wu 002 (Electron. Colloquium Comput. Complex., 2025)

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)

AutoV: Learning to Retrieve Visual Prompt for Large Vision-Language Models. - Yuan Zhang 020; Chun-Kai Fan; Tao Huang 020; Ming Lu; Sicheng Yu; Junwen Pan; Kuan Cheng; Qi She; Shanghang Zhang (CoRR, 2025)