| 1-bit matrix completion MA Davenport, Y Plan, E Van Den Berg, M Wootters Information and Inference: A Journal of the IMA 3 (3), 189-223, 2014 | 332 | 2014 |
| Strategic classification M Hardt, N Megiddo, C Papadimitriou, M Wootters Proceedings of the 2016 ACM conference on innovations in theoretical …, 2016 | 197 | 2016 |
| Repairing reed-solomon codes V Guruswami, M Wootters IEEE transactions on Information Theory 63 (9), 5684-5698, 2017 | 155 | 2017 |
| Fast matrix completion without the condition number M Hardt, M Wootters Conference on learning theory, 638-678, 2014 | 109 | 2014 |
| Exponential decay of reconstruction error from binary measurements of sparse signals RG Baraniuk, S Foucart, D Needell, Y Plan, M Wootters IEEE Transactions on Information Theory 63 (6), 3368-3385, 2017 | 108 | 2017 |
| The N3XT approach to energy-efficient abundant-data computing MMS Aly, TF Wu, A Bartolo, YH Malviya, W Hwang, G Hills, I Markov, ... Proceedings of the IEEE 107 (1), 19-48, 2018 | 70 | 2018 |
| Every list-decodable code for high noise has abundant near-optimal rate puncturings A Rudra, M Wootters Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 51 | 2014 |
| New constructions of RIP matrices with fast multiplication and fewer rows J Nelson, E Price, M Wootters Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 51 | 2014 |
| Repairing multiple failures for scalar MDS codes J Mardia, B Bartan, M Wootters IEEE Transactions on Information Theory 65 (5), 2661-2672, 2018 | 42* | 2018 |
| Recovering simple signals AC Gilbert, B Hemenway, A Rudra, MJ Strauss, M Wootters 2012 Information Theory and Applications Workshop, 382-391, 2012 | 42 | 2012 |
| Local correctability of expander codes B Hemenway, R Ostrovsky, M Wootters Information and Computation 243, 178-190, 2015 | 41 | 2015 |
| Stochastic gradient coding for straggler mitigation in distributed learning R Bitar, M Wootters, S El Rouayheb IEEE Journal on Selected Areas in Information Theory 1 (1), 277-291, 2020 | 40 | 2020 |
| Can we access a database both locally and privately? E Boyle, Y Ishai, R Pass, M Wootters Theory of Cryptography Conference, 662-693, 2017 | 38 | 2017 |
| Local list recovery of high-rate tensor codes and applications B Hemenway, N Ron-Zewi, M Wootters SIAM Journal on Computing 49 (4), FOCS17-157-FOCS17-195, 2019 | 34 | 2019 |
| On the optimality of the Kautz-Singleton construction in probabilistic group testing HA Inan, P Kairouz, M Wootters, A Özgür IEEE Transactions on Information Theory 65 (9), 5592-5603, 2019 | 33 | 2019 |
| Resistive RAM endurance: Array-level characterization and correction techniques targeting deep learning applications A Grossi, E Vianello, MM Sabry, M Barlas, L Grenouillet, J Coignus, ... IEEE Transactions on Electron Devices 66 (3), 1281-1288, 2019 | 32 | 2019 |
| On the list decodability of random linear codes with large error rates M Wootters Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 31 | 2013 |
| Linear-time list recovery of high-rate expander codes B Hemenway, M Wootters Information and Computation 261, 202-218, 2018 | 29 | 2018 |
| One-bit compressive sensing of dictionary-sparse signals R Baraniuk, S Foucart, D Needell, Y Plan, M Wootters Information and Inference: A Journal of the IMA 7 (1), 83-104, 2018 | 29 | 2018 |
| Improved decoding of folded Reed-Solomon and multiplicity codes S Kopparty, N Ron-Zewi, S Saraf, M Wootters 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 28 | 2018 |
