Minshen Zhu

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 20

Top Topics

Insertions And Deletions

Top Venues

IEEE Trans. Inf. Theory

Publications

John S. McCaskill, Daniil Karnaushenko, Minshen Zhu, Oliver G. Schmidt
Microelectronic Morphogenesis: Progress towards Artificial Organisms. CoRR (2023)
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)
Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. CoRR (2023)
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 (2022)
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 (2022)
Elena Grigorescu, Madhu Sudan, Minshen Zhu
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. IEEE Trans. Inf. Theory 68 (10) (2022)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR (2021)
Elena Grigorescu, Madhu Sudan, Minshen Zhu
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. ISIT (2021)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. Algorithmica 83 (8) (2021)
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 (2021)
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)
Elena Grigorescu, Madhu Sudan, Minshen Zhu
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. CoRR (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. ESA (2020)
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC (2020)
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
Locally Decodable/Correctable Codes for Insertions and Deletions. CoRR (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. CoRR (2019)
Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. SODA (2017)
Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu
Maximally recoverable codes: The bounded case. Allerton (2017)
Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. CoRR (2016)