Minshen Zhu 朱旻申
I am a 5th-year Computer Science PhD student at Purdue University. My advisor is Professor Elena Grigorescu.
Contact
Postal Address
Lawson Computer Science Building, Purdue University
305 N. University Street, West Lafayette, IN 47907, United States
Office
Room 2161, Lawson Computer Science Building
minshen.zh AT gmail.com
Research Interests
I am interested in theoretical computer science. I have been working on many interesting topics including approximate counting, coding theory and combinatorial optimization.
Papers
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
with Alex Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng.
(To Appear) In Computational Complexity Conference (CCC'23)
Exponential Lower Bounds for Locally Decodable Codes Correcting Insertions and Deletions
with Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng.
In 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'21)
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance
with Elena Grigorescu, Madhu Sudan.
In IEEE Transactions on Information Theory
A preliminary version appeared in 2021 IEEE International Symposium on Information Theory (ISIT'21)
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
with Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin.
In 15th International Symposium on Parameterized and Exact Computation (IPEC'20)
Locally Decodable/Correctable Codes for Insertions and Deletions
with Alex Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni.
In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Sciences (FSTTCS'20)
The Maximum Binary Tree Problem
with Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin.
In Algorithmica
A preliminary version appeared in The European Symposium on Algorithms, 2020 (ESA'20)
Maximally Recoverable Codes: the Bounded Case
with Venkata Gandikota, Elena Grigorescu, Clayton Thomas.
In Allerton Conference on Communication, Control and Computing, 2017 (Allerton'17)
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
with Pinyan Lu, Kuan Yang, Chihao Zhang.
In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pp.1798-1817, 2017.