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 | 373 | 2014 |

Strategic classification M Hardt, N Megiddo, C Papadimitriou, M Wootters Proceedings of the 2016 ACM conference on innovations in theoretical …, 2016 | 256 | 2016 |

Repairing reed-solomon codes V Guruswami, M Wootters Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 168 | 2016 |

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 | 120 | 2017 |

Fast matrix completion without the condition number M Hardt, M Wootters Conference on learning theory, 638-678, 2014 | 119 | 2014 |

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 | 94 | 2018 |

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 | 59 | 2020 |

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 | 56 | 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 | 54 | 2014 |

Can we access a database both locally and privately? E Boyle, Y Ishai, R Pass, M Wootters Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 51 | 2017 |

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes S Chandak, K Tatwawadi, B Lau, J Mardia, M Kubit, J Neu, P Griffin, ... 2019 57th Annual Allerton Conference on Communication, Control, and …, 2019 | 50 | 2019 |

Local correctability of expander codes B Hemenway, R Ostrovsky, M Wootters Information and Computation 243, 178-190, 2015 | 46 | 2015 |

Repairing multiple failures for scalar MDS codes J Mardia, B Bartan, M Wootters IEEE Transactions on Information Theory 65 (5), 2661-2672, 2018 | 45* | 2018 |

Recovering simple signals AC Gilbert, B Hemenway, A Rudra, MJ Strauss, M Wootters 2012 Information Theory and Applications Workshop, 382-391, 2012 | 44 | 2012 |

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 | 41 | 2019 |

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 | 39 | 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 | 38 | 2019 |

Overcoming high nanopore basecaller error rates for DNA storage via basecaller-decoder integration and convolutional codes S Chandak, J Neu, K Tatwawadi, J Mardia, B Lau, M Kubit, R Hulett, ... ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and …, 2020 | 37 | 2020 |

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 | 34 | 2018 |

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 | 32 | 2013 |