Minshen Zhu

Computer Science · Purdue University West Lafayette

Mid career · publishing since 2016

Algorithms and Data Compression Complexity and Algorithms in Graphs DNA and Biological Computing Advanced Graph Theory Research Distributed systems and fault tolerance

Publications

Citations

Est. group size

Recurring co-author estimate

Active years

Publishing since 2016

Research summary

AI-generated

Minshen Zhu works in theoretical computer science, focusing on the design and analysis of algorithms for problems involving sequences, graphs, and codes. A recurring topic is 'trace reconstruction,' which studies how to recover an original piece of data (like a DNA or digital sequence) from noisy, garbled copies of it, as well as related problems in combinatorics and coding theory. This work is mathematical in nature, aiming to prove what is and isn't computationally possible or efficient for these problems.

Trace reconstruction from noisy dataAlgorithm design and complexity analysisGraph theory and combinatorial structuresCoding theory (recoverable codes)Approximation and counting algorithms

Publication output has been modest and fairly steady over the last decade, with small yearly counts (mostly 1-4 papers) and no clear growth or decline trend.

Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026

Publication cadence

Publications per year over the last 10 years — averaging 1.4/year recently

Recent publications

On <i>k</i>-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
IEEE Transactions on Information Theory · 2025
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
2024
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
arXiv (Cornell University) · 2023
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance
IEEE Transactions on Information Theory · 2022
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance
2021
The Maximum Binary Tree Problem
Algorithmica · 2021
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
arXiv (Cornell University) · 2021
The Maximum Binary Tree Problem.
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2020
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance
arXiv (Cornell University) · 2020
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2020
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
arXiv (Cornell University) · 2019
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
2017
Maximally recoverable codes: The bounded case
2017
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
arXiv (Cornell University) · 2016

Publishes in

arXiv (Cornell University)×6
IEEE Transactions on Information Theory×2
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×2
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×1
Algorithmica×1

Similar researchers

By research-topic overlap

Funda Ergün
Computer Science · Indiana University
M. Oğuzhan Külekçi
Computer Science · Indiana University
Wojciech Szpankowski
Computer Science · Purdue University West Lafayette
Cynthia A. Brown
Computer Science · Indiana University
Mark Daniel Ward
Computer Science · Purdue University West Lafayette

This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.

Last updated Jul 20, 2026.

Claim or correct this profile