Minshen Zhu

MaRDI QIDQ2041977zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Locally decodable/correctable codes for insertions and deletions	2026-03-23	Paper
Exponential lower bounds for locally decodable and correctable codes for insertions and deletions	2025-08-13	Paper
On k-mer-based and maximum likelihood estimation algorithms for trace reconstruction IEEE Transactions on Information Theory	2025-07-11	Paper
On relaxed locally decodable codes for Hamming and insertion-deletion errors	2024-11-19	Paper
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance IEEE Transactions on Information Theory	2024-03-14	Paper
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree (available as arXiv preprint)	2023-11-13	Paper
The Maximum Binary Tree Problem.	2023-02-07	Paper
The maximum binary tree problem Algorithmica	2021-07-26	Paper
The maximum binary tree problem Algorithmica	2021-07-26	Paper
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance	2020-11-27	Paper
An FPTAS for counting proper four-colorings on cubic graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper

Research outcomes over time

This page was built for person: Minshen Zhu