default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKuan Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c23]Kuan Cheng, Ruiyang Wu:
Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions. SODA 2026: 3423-3458- [i37]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes. CoRR abs/2602.20278 (2026) - [i36]Kuan Cheng, Xin Li, Songtao Mao:
When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs. CoRR abs/2603.03717 (2026) - [i35]Yuan Zhang, Lifeng Guo, Junwen Pan, Wenzhao Zheng, Wen Zhou, Kuan Cheng, Kurt Keutzer, Shanghang Zhang:
SEED: Targeted Data Selection by Weighted Independent Set. CoRR abs/2605.15691 (2026) - 2025
- [j7]Kuan Cheng
, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. IEEE Trans. Inf. Theory 71(4): 2591-2603 (2025) - [j6]Yuanting Shen, Chong Shangguan, Minghui Ouyang, Kuan Cheng:
When Can an Expander Code Correct Ω(n) Errors in O(n) Time? IEEE Trans. Inf. Theory 71(10): 7626-7643 (2025) - [c22]Yuan Zhang, Chun-Kai Fan, Junpeng Ma, Wenzhao Zheng, Tao Huang, Kuan Cheng, Denis A. Gudovskiy, Tomoyuki Okuno, Yohei Nakata, Kurt Keutzer, Shanghang Zhang:
SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference. ICML 2025 - [i34]Kuan Cheng, Ruiyang Wu:
Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions. CoRR abs/2502.08272 (2025) - [i33]Yuan Zhang, Chun-Kai Fan, Tao Huang, Ming Lu, Sicheng Yu, Junwen Pan, Kuan Cheng, Qi She, Shanghang Zhang:
AutoV: Learning to Retrieve Visual Prompt for Large Vision-Language Models. CoRR abs/2506.16112 (2025) - [i32]Yuan Zhang, Ming Lu, Junwen Pan, Tao Huang, Kuan Cheng, Qi She, Shanghang Zhang:
ChainV: Atomic Visual Hints Make Multimodal Reasoning Shorter and Better. CoRR abs/2511.17106 (2025) - [i31]Chengkai Hou, Kun Wu, Jiaming Liu, Zhengping Che, Di Wu, Fei Liao, Guangrun Li, Jingyang He, Qiuxuan Feng, Zhao Jin, Chenyang Gu, Zhuoyang Liu, Nuowei Han, Xiangju Mi, Yaoxu Lv, Yankai Fu, Gaole Dai, Langzhe Gu, Tao Li, Yuheng Zhang, Yixue Zhang, Xinhua Wang, Shichao Fan, Meng Li, Zhen Zhao, Ning Liu, Zhiyuan Xu, Pei Ren, Junjie Ji, Haonan Liu, Kuan Cheng, Shanghang Zhang, Jian Tang:
RoboMIND 2.0: A Multimodal, Bimanual Mobile Manipulation Dataset for Generalizable Embodied Intelligence. CoRR abs/2512.24653 (2025) - [i30]Kuan Cheng, Ruiyang Wu:
Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions. Electron. Colloquium Comput. Complex. TR25: Article TR25-027 (2025) - 2024
- [c21]Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen:
When Can an Expander Code Correct Ω(n) Errors in O(n) Time? APPROX/RANDOM 2024: 61:1-61:23 - [c20]Kuan Cheng, Ruiyang Wu:
Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors. APPROX/RANDOM 2024: 69:1-69:22 - [c19]Kuan Cheng, Yichuan Wang:
BPL ⊆ L-AC¹. CCC 2024: 32:1-32:14 - [c18]Yuan Zhang, Tao Huang, Jiaming Liu, Tao Jiang, Kuan Cheng, Shanghang Zhang:
FreeKD: Knowledge Distillation via Semantic Frequency Prompt. CVPR 2024: 15931-15940 - [c17]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. ISIT 2024: 879-884 - [c16]Yuan Zhang, Fei Xiao, Tao Huang, Chun-Kai Fan, Hongyuan Dong, Jiawen Li, Jiacong Wang, Kuan Cheng, Shanghang Zhang, Haoyuan Guo:
Unveiling the Tapestry of Consistency in Large Vision-Language Models. NeurIPS 2024 - [i29]Yuan Zhang, Fei Xiao, Tao Huang, Chun-Kai Fan, Hongyuan Dong, Jiawen Li, Jiacong Wang, Kuan Cheng, Shanghang Zhang, Haoyuan Guo:
Unveiling the Tapestry of Consistency in Large Vision-Language Models. CoRR abs/2405.14156 (2024) - [i28]Yuan Zhang, Chun-Kai Fan, Junpeng Ma, Wenzhao Zheng, Tao Huang, Kuan Cheng, Denis A. Gudovskiy, Tomoyuki Okuno, Yohei Nakata, Kurt Keutzer, Shanghang Zhang:
SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference. CoRR abs/2410.04417 (2024) - [i27]Kuan Cheng, Ruiyang Wu:
Randomness Extractors in $\mathrm{AC}^0$ and $\mathrm{NC}^1$: Optimal up to Constant Factors. Electron. Colloquium Comput. Complex. TR24: Article TR24-040 (2024) - [i26]Kuan Cheng, Yichuan Wang:
$BPL\subseteq L-AC^1$. Electron. Colloquium Comput. Complex. TR24: Article TR24-048 (2024) - 2023
- [j5]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) - [j4]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. IEEE Trans. Inf. Theory 69(6): 3574-3589 (2023) - [c15]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 - [c14]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Applications. COCOON (2) 2023: 184-197 - [c13]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 - [c12]Kuan Cheng, Shaofeng H.-C. Jiang, Luojian Wei, Zhide Wei:
On The Relative Error of Random Fourier Features for Preserving Kernel Distance. ICLR 2023 - [i25]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) - [i24]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. CoRR abs/2308.14993 (2023) - [i23]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Applications. CoRR abs/2308.15746 (2023) - [i22]Yuan Zhang, Tao Huang, Jiaming Liu, Tao Jiang, Kuan Cheng, Shanghang Zhang:
FreeKD: Knowledge Distillation via Semantic Frequency Prompt. CoRR abs/2311.12079 (2023) - [i21]Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen:
Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. CoRR abs/2312.16087 (2023) - [i20]Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Application. Electron. Colloquium Comput. Complex. TR23: Article TR23-128 (2023) - 2022
- [j3]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) - [j2]Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. Theory Comput. 18: 1-32 (2022) - [c11]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. ITCS 2022: 43:1-43:3 - [i19]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) - [i18]Kuan Cheng, Shaofeng H.-C. Jiang, Luojian Wei, Zhide Wei:
On The Relative Error of Random Fourier Features for Preserving Kernel Distance. CoRR abs/2210.00244 (2022) - 2021
- [c10]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 - [c9]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 - [c8]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SODA 2021: 1-20 - [c7]Kuan Cheng, Xin Li:
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. SODA 2021: 2424-2443 - [i17]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) - [i16]Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. CoRR abs/2111.07629 (2021) - 2020
- [c6]Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. CCC 2020: 10:1-10:25 - [i15]Kuan Cheng, Xin Li, Yu Zheng:
Locally Decodable Codes with Randomized Encoding. CoRR abs/2001.03692 (2020) - [i14]Kuan Cheng, Zhengzhong Jin, Xin Li, Yu Zheng:
Space Efficient Deterministic Approximation of String Measures. CoRR abs/2002.08498 (2020) - [i13]Kuan Cheng, Xin Li:
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. CoRR abs/2007.00870 (2020) - [i12]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. CoRR abs/2007.09075 (2020) - [i11]Kuan Cheng, William Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. Electron. Colloquium Comput. Complex. TR20: Article TR20-016 (2020) - [i10]Kuan Cheng, Xin Li, Yu Zheng:
Locally Decodable Codes with Randomized Encoding. IACR Cryptol. ePrint Arch. 2020: 31 (2020)
2010 – 2019
- 2019
- [c5]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 - [c4]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. SODA 2019: 2185-2204 - 2018
- [c3]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. APPROX-RANDOM 2018: 37:1-37:20 - [c2]Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. FOCS 2018: 200-211 - [i9]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) - [i8]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) - [i7]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) - 2017
- [j1]Yongbo Li, Xiandong Yin, Weiling Liu, Yafeng Liu, Weihan Gou, Kuan Cheng:
Cold Centering Algorithm on Pipe Based on Laser Measurement. J. Adv. Comput. Intell. Intell. Informatics 21(3): 397-402 (2017) - [c1]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 - [i6]Kuan Cheng, Xin Li, Ke Wu:
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR abs/1710.07356 (2017) - [i5]Kuan Cheng, Yuval Ishai, Xin Li:
Near-Optimal Secret Sharing and Error Correcting Codes in AC0. IACR Cryptol. ePrint Arch. 2017: 927 (2017) - 2016
- [i4]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. CoRR abs/1602.01530 (2016) - [i3]Kuan Cheng, Xin Li:
Randomness Extraction in AC0 and with Small Locality. Electron. Colloquium Comput. Complex. TR16: Article TR16-018 (2016) - 2014
- [i2]Kuan Cheng:
Pseudorandom Generator Based on Hard Lattice Problem. IACR Cryptol. ePrint Arch. 2014: 2 (2014) - 2013
- [i1]Kuan Cheng:
Some Improved Complexity Results for uSVP and GapSVP. IACR Cryptol. ePrint Arch. 2013: 52 (2013)
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 2026-07-04 00:50 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
