Maximally recoverable codes: The bounded case. - Venkata Gandikota; Elena Grigorescu; Clayton Thomas; Minshen Zhu (Allerton, 2017)

An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. - Pinyan Lu; Kuan Yang 001; Chihao Zhang 001; Minshen Zhu (SODA, 2017)

Locally Decodable/Correctable Codes for Insertions and Deletions. - Alexander R. Block; Jeremiah Blocki; Elena Grigorescu; Shubhang Kulkarni; Minshen Zhu (FSTTCS, 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 (IPEC, 2020)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. - Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (FOCS, 2021)

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. - Elena Grigorescu; Madhu Sudan 001; Minshen Zhu (ISIT, 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 Edit Distance. - Elena Grigorescu; Madhu Sudan 001; Minshen Zhu (IEEE Trans. Inf. Theory, 2022)

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. - Alexander R. Block; Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (CCC, 2023)

Microelectronic Morphogenesis: Progress towards Artificial Organisms. - John S. McCaskill; Daniil Karnaushenko; Minshen Zhu; Oliver G. Schmidt (CoRR, 2023)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. - Kuan Cheng; Elena Grigorescu; Xin Li 006; Madhu Sudan 001; Minshen Zhu (IEEE Trans. Inf. Theory, 2025)