Minshen Zhu

According to our database, Minshen Zhu authored at least 11 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

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

Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu

CoRR, 2023

Microelectronic Morphogenesis: Progress towards Artificial Organisms.

John S. McCaskill, Daniil Karnaushenko, Minshen Zhu, Oliver G. Schmidt

CoRR, 2023

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

Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance.

Elena Grigorescu, Madhu Sudan, Minshen Zhu

IEEE Trans. Inf. Theory, 2022

2021

The Maximum Binary Tree Problem.

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu

Algorithmica, 2021

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance.

Elena Grigorescu, Madhu Sudan, Minshen Zhu

Proceedings of the IEEE International Symposium on Information Theory, 2021

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

Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu

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.

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.

Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2017

An FPTAS for Counting Proper Four-Colorings on Cubic Graphs.

Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Maximally recoverable codes: The bounded case.

Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu

Proceedings of the 55th Annual Allerton Conference on Communication, 2017