Minshen Zhu

Orcid: 0000-0003-1927-6085

According to our database1, Minshen Zhu authored at least 12 papers between 2017 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes.
CoRR, February, 2026

2024
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Microelectronic Morphogenesis: Progress towards Artificial Organisms.
CoRR, 2023

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

2022
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance.
IEEE Trans. Inf. Theory, 2022

2021
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance.
Proceedings of the IEEE International Symposium on Information Theory, 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
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

The Maximum Binary Tree Problem.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2017
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Maximally recoverable codes: The bounded case.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017


  Loading...