Kuan Cheng

Orcid: 0000-0002-8972-1749

According to our database¹, Kuan Cheng authored at least 36 papers between 2013 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

$BPL\subseteq L-AC^1$.

[BibT_eX]

[DOI]

Kuan Cheng

Yichuan Wang

Electron. Colloquium Comput. Complex., 2024

Randomness Extractors in $\mathrm{AC}^0$ and $\mathrm{NC}^1$: Optimal up to Constant Factors.

[BibT_eX]

[DOI]

Kuan Cheng

Ruiyang Wu

Electron. Colloquium Comput. Complex., 2024

SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference.

[BibT_eX]

[DOI]

CoRR, 2024

Unveiling the Tapestry of Consistency in Large Vision-Language Models.

[BibT_eX]

[DOI]

CoRR, 2024

On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

FreeKD: Knowledge Distillation via Semantic Frequency Prompt.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024

BPL ⊆ L-AC¹.

[BibT_eX]

[DOI]

Kuan Cheng

Yichuan Wang

Proceedings of the 39th Computational Complexity Conference, 2024

Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors.

[BibT_eX]

[DOI]

Kuan Cheng

Ruiyang Wu

Proceedings of the Approximation, 2024

When Can an Expander Code Correct Ω(n) Errors in O(n) Time?

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Improved Decoding of Expander Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2023

Efficient Linear and Affine Codes for Correcting Insertions/Deletions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Random Shortening of Linear Codes and Application.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code.

[BibT_eX]

[DOI]

CoRR, 2023

On The Relative Error of Random Fourier Features for Preserving Kernel Distance.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Random Shortening of Linear Codes and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors.

[BibT_eX]

[DOI]

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors.

[BibT_eX]

[DOI]

J. ACM, 2022

2021

Efficient Document Exchange and Error Correcting Codes with Asymmetric Information.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.

[BibT_eX]

[DOI]

Kuan Cheng

Alireza Farhadi

MohammadTaghi Hajiaghayi

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Locally Decodable Codes with Randomized Encoding.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Yu Zheng

IACR Cryptol. ePrint Arch., 2020

Hitting Sets Give Two-Sided Derandomization of Small Space.

[BibT_eX]

[DOI]

Kuan Cheng

William Hoza

Electron. Colloquium Comput. Complex., 2020

Space Efficient Deterministic Approximation of String Measures.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets.

[BibT_eX]

[DOI]

Kuan Cheng

Bernhard Haeupler

Xin Li

Amirbehshad Shahrasbi

Ke Wu

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes.

[BibT_eX]

[DOI]

CoRR, 2018

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets.

[BibT_eX]

[DOI]

Kuan Cheng

Bernhard Haeupler

Xin Li

Amirbehshad Shahrasbi

Ke Wu

CoRR, 2018

Randomness Extraction in AC0 and with Small Locality.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Proceedings of the Approximation, 2018

2017

Cold Centering Algorithm on Pipe Based on Laser Measurement.

[BibT_eX]

[DOI]

J. Adv. Comput. Intell. Intell. Informatics, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in AC0.

[BibT_eX]

[DOI]

Kuan Cheng

Yuval Ishai

Xin Li

IACR Cryptol. ePrint Arch., 2017

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Ke Wu

CoRR, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0.

[BibT_eX]

[DOI]

Kuan Cheng

Yuval Ishai

Xin Li

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016

Randomness Extraction in AC<sup>0</sup> and with Small Locality.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Electron. Colloquium Comput. Complex., 2016

2014

Pseudorandom Generator Based on Hard Lattice Problem.

[BibT_eX]

[DOI]

Kuan Cheng

IACR Cryptol. ePrint Arch., 2014

2013

Some Improved Complexity Results for uSVP and GapSVP.

[BibT_eX]

[DOI]

Kuan Cheng

IACR Cryptol. ePrint Arch., 2013

Kuan Cheng

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...