Kuan Cheng

Orcid: 0000-0002-8972-1749

According to our database1, Kuan Cheng authored at least 31 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
$BPL\subseteq L-AC^1$.
Electron. Colloquium Comput. Complex., 2024

Randomness Extractors in $\mathrm{AC}^0$ and $\mathrm{NC}^1$: Optimal up to Constant Factors.
Electron. Colloquium Comput. Complex., 2024

2023
Improved Decoding of Expander Codes.
IEEE Trans. Inf. Theory, June, 2023

Efficient Linear and Affine Codes for Correcting Insertions/Deletions.
SIAM J. Discret. Math., June, 2023

Random Shortening of Linear Codes and Application.
Electron. Colloquium Comput. Complex., 2023

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

FreeKD: Knowledge Distillation via Semantic Frequency Prompt.
CoRR, 2023

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction.
CoRR, 2023

On The Relative Error of Random Fourier Features for Preserving Kernel Distance.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Random Shortening of Linear Codes and Applications.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Hitting Sets Give Two-Sided Derandomization of Small Space.
Theory Comput., 2022

Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors.
J. ACM, 2022

2021
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.
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.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Locally Decodable Codes with Randomized Encoding.
IACR Cryptol. ePrint Arch., 2020

Space Efficient Deterministic Approximation of String Measures.
CoRR, 2020

2019
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets.
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.
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.
CoRR, 2018

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

Randomness Extraction in AC0 and with Small Locality.
Proceedings of the Approximation, 2018

2017
Cold Centering Algorithm on Pipe Based on Laser Measurement.
J. Adv. Comput. Intell. Intell. Informatics, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in AC0.
IACR Cryptol. ePrint Arch., 2017

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

Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016
Randomness Extraction in AC<sup>0</sup> and with Small Locality.
Electron. Colloquium Comput. Complex., 2016

2014
Pseudorandom Generator Based on Hard Lattice Problem.
IACR Cryptol. ePrint Arch., 2014

2013
Some Improved Complexity Results for uSVP and GapSVP.
IACR Cryptol. ePrint Arch., 2013


  Loading...