Limitations of mean-based algorithms for trace reconstruction at small edit distance E Grigorescu, M Sudan, M Zhu
IEEE Transactions on Information Theory 68 (10), 6790-6801, 2022
21 * 2022 An FPTAS for counting proper four-colorings on cubic graphs P Lu, K Yang, C Zhang, M Zhu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
14 2017 Locally decodable/correctable codes for insertions and deletions AR Block, J Blocki, E Grigorescu, S Kulkarni, M Zhu
arXiv preprint arXiv:2010.11989, 2020
11 2020 Exponential lower bounds for locally decodable and correctable codes for insertions and deletions J Blocki, K Cheng, E Grigorescu, X Li, Y Zheng, M Zhu
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
6 2022 On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors A Block, J Blocki, K Cheng, E Grigorescu, X Li, Y Zheng, M Zhu
38th Computational Complexity Conference, CCC 2023, 2023
4 2023 On K Cheng, E Grigorescu, X Li, M Sudan, M Zhu
2024 IEEE International Symposium on Information Theory (ISIT), 879-884, 2024
3 2024 The maximum binary tree problem K Chandrasekaran, E Grigorescu, G Istrate, S Kulkarni, YS Lin, M Zhu
Algorithmica 83 (8), 2427-2468, 2021
3 2021 Maximally recoverable codes: The bounded case V Gandikota, E Grigorescu, C Thomas, M Zhu
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
3 2017 Fixed-parameter algorithms for longest heapable subsequence and maximum binary tree K Chandrasekaran, E Grigorescu, G Istrate, S Kulkarni, YS Lin, M Zhu
arXiv preprint arXiv:2110.00495, 2021
2 2021 Reconstruction and Local Recovery of Data from Synchronization Errors M Zhu
Purdue University Graduate School, 2023
2023 