| Explicit constructions of high-rate MDS array codes with optimal repair bandwidth M Ye, A Barg IEEE Transactions on Information Theory 63 (4), 2001-2014, 2017 | 201 | 2017 |
| Optimal schemes for discrete distribution estimation under locally differential privacy M Ye, A Barg IEEE Transactions on Information Theory 64 (8), 5662-5676, 2018 | 164 | 2018 |
| Communication-computation efficient gradient coding M Ye, E Abbe 35th International Conference on Machine Learning (ICML), 5610-5619, 2018 | 159 | 2018 |
| Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization M Ye, A Barg IEEE Transactions on Information Theory 63 (10), 6307-6317, 2017 | 158 | 2017 |
| Clay codes: Moulding {MDS} codes to yield an {MSR} code M Vajha, V Ramkumar, B Puranik, G Kini, E Lobo, B Sasidharan, ... 16th {USENIX} Conference on File and Storage Technologies ({FAST} 18), 139-154, 2018 | 91 | 2018 |
| Recursive projection-aggregation decoding of Reed-Muller codes M Ye, E Abbe IEEE Transactions on Information Theory 66 (8), 4948-4965, 2020 | 64 | 2020 |
| Optimal repair of Reed-Solomon codes: Achieving the cut-set bound I Tamo, M Ye, A Barg 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 216-227, 2017 | 60 | 2017 |
| Reed–Muller codes: Theory and algorithms E Abbe, A Shpilka, M Ye IEEE Transactions on Information Theory 67 (6), 3251-3277, 2020 | 54 | 2020 |
| Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth M Ye, A Barg 2016 IEEE International Symposium on Information Theory (ISIT), 1202-1206, 2016 | 48 | 2016 |
| Cooperative repair: Constructions of optimal MDS codes for all admissible parameters M Ye, A Barg IEEE Transactions on Information Theory 65 (3), 1639-1656, 2018 | 44 | 2018 |
| The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size I Tamo, M Ye, A Barg IEEE Transactions on Information Theory 65 (5), 2673-2695, 2019 | 41 | 2019 |
| Construction of polar codes for arbitrary discrete memoryless channels TC Gulcu, M Ye, A Barg IEEE Transactions on Information Theory 64 (1), 309-321, 2018 | 37 | 2018 |
| Reed-Muller codes polarize E Abbe, M Ye IEEE Transactions on Information Theory 66 (12), 7311-7332, 2020 | 30 | 2020 |
| Arikan meets Shannon: Polar codes with near-optimal convergence to channel capacity V Guruswami, A Riazanov, M Ye Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 18 | 2020 |
| Enabling optimal access and error correction for the repair of Reed–Solomon codes Z Chen, M Ye, A Barg IEEE Transactions on Information Theory 66 (12), 7439-7456, 2020 | 15 | 2020 |
| Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures M Ye, A Barg arXiv preprint arXiv:1710.07216, 2017 | 15 | 2017 |
| Polar codes using dynamic kernels M Ye, A Barg 2015 IEEE International Symposium on Information Theory (ISIT), 231-235, 2015 | 15 | 2015 |
| Fractional decoding: Error correction from partial information I Tamo, M Ye, A Barg 2017 IEEE International Symposium on Information Theory (ISIT), 998-1002, 2017 | 14 | 2017 |
| Asymptotically optimal private estimation under mean square loss M Ye, A Barg arXiv preprint arXiv:1708.00059, 2017 | 11 | 2017 |
| Polar codes for distributed hierarchical source coding M Ye, A Barg Advances in Mathematics of Communications 9 (1), 87-103, 2015 | 11 | 2015 |
Alexander BargUniversity of MarylandVerified email at umd.edu
