Min Ye
Orcid: 0000-0003-1351-8880Affiliations:
- Tsinghua-Berkeley Shenzhen Institute, China
- University of Maryland, Department of ECE and ISR, College Park, MD, USA (former)
According to our database1,
Min Ye
authored at least 45 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
2
5
2
3
5
3
5
4
1
1
1
2
1
3
3
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes.
IEEE Trans. Inf. Theory, November, 2024
IEEE Trans. Inf. Theory, February, 2024
2023
IEEE Trans. Commun., July, 2023
IEEE Trans. Inf. Theory, June, 2023
IEEE Trans. Inf. Theory, April, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
IEEE Trans. Inf. Theory, 2022
CoRR, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
IEEE Trans. Inf. Theory, 2021
CoRR, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
IEEE Trans. Inf. Theory, 2020
IEEE Trans. Inf. Theory, 2020
IEEE Trans. Inf. Theory, 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters.
IEEE Trans. Inf. Theory, 2019
The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.
IEEE Trans. Inf. Theory, 2019
Electron. Colloquium Comput. Complex., 2019
2018
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy.
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.
CoRR, 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018
2017
Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization.
IEEE Trans. Inf. Theory, 2017
IEEE Trans. Inf. Theory, 2017
Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures.
CoRR, 2017
Optimal schemes for discrete distribution estimation under local differential privacy.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth.
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014