Configuration spaces of convex and embedded polygons in the plane - Don Shimamoto; Mary Wootters (CoRR, 2008)

Public Key Locally Decodable Codes with Short Keys. - Brett Hemenway; Rafail Ostrovsky; Martin Strauss 001; Mary Wootters (Electron. Colloquium Comput. Complex., 2011)

Recovering simple signals. - Anna C. Gilbert; Brett Hemenway; Atri Rudra; Martin J. Strauss; Mary Wootters (ITA, 2012)

Reusable low-error compressive sampling schemes through privacy. - Anna C. Gilbert; Brett Hemenway; Martin J. Strauss; David P. Woodruff; Mary Wootters (SSP, 2012)

1-Bit Matrix Completion - Mark A. Davenport; Yaniv Plan; Ewout van den Berg; Mary Wootters (CoRR, 2012)

Lower bounds for quantized matrix completion. - Mary Wootters; Yaniv Plan; Mark A. Davenport; Ewout van den Berg (ISIT, 2013)

On the list decodability of random linear codes with large error rates. - Mary Wootters (STOC, 2013)

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. - Denisa Duma; Mary Wootters; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra; Matthew Alpert; Timothy J. Close; Gianfranco Ciardo; Stefano Lonardi (WABI, 2013)

On the list decodability of random linear codes with large error rate - Mary Wootters (CoRR, 2013)

Every list-decodable code for high noise has abundant near-optimal rate puncturings. - Atri Rudra; Mary Wootters (Electron. Colloquium Comput. Complex., 2013)

Fast matrix completion without the condition number. - Moritz Hardt; Mary Wootters (COLT, 2014)

New constructions of RIP matrices with fast multiplication and fewer rows. - Jelani Nelson; Eric Price 001; Mary Wootters (SODA, 2014)

It'll probably work out: improved list-decoding through random operations. - Atri Rudra; Mary Wootters (Electron. Colloquium Comput. Complex., 2014)

Local correctability of expander codes. - Brett Hemenway; Rafail Ostrovsky; Mary Wootters (Inf. Comput., 2015)

Strategic Classification. - Moritz Hardt; Nimrod Megiddo; Christos H. Papadimitriou; Mary Wootters (ITCS, 2016)

One-Bit Compressive Sensing of Dictionary-Sparse Signals. - Richard G. Baraniuk; Simon Foucart; Deanna Needell; Yaniv Plan; Mary Wootters (CoRR, 2016)

Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. - Nicole Megow; Mary Wootters (Theory Comput., 2016)

Repairing multiple failures for scalar MDS codes. - Burak Bartan; Mary Wootters (Allerton, 2017)

Limitations of piggybacking codes with low substriping. - Reyna Hulett; Mary Wootters (Allerton, 2017)

Locality via Partially Lifted Codes. - S. Luna Frank-Fischer; Venkatesan Guruswami; Mary Wootters (APPROX-RANDOM, 2017)

Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping. - Reyna Hulett; Mary Wootters (CoRR, 2017)

Average-radius list-recovery of random linear codes: it really ties the room together. - Atri Rudra; Mary Wootters (CoRR, 2017)

Local List Recovery of High-rate Tensor Codes & Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (Electron. Colloquium Comput. Complex., 2017)

Can We Access a Database Both Locally and Privately? - Elette Boyle; Yuval Ishai; Rafael Pass; Mary Wootters (IACR Cryptol. ePrint Arch., 2017)

Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. - Richard G. Baraniuk; Simon Foucart; Deanna Needell; Yaniv Plan; Mary Wootters (IEEE Trans. Inf. Theory, 2017)

Repairing Reed-Solomon Codes. - Venkatesan Guruswami; Mary Wootters (IEEE Trans. Inf. Theory, 2017)

Load-Balanced Fractional Repetition Codes. - Alexandra M. Porter; Shashwat Silas; Mary Wootters (ISIT, 2018)

On Taking Advantage of Multiple Requests in Error Correcting Codes. - Prasanna Ramakrishnan; Mary Wootters (ISIT, 2018)

Average-radius list-recoverability of random linear codes. - Atri Rudra; Mary Wootters (SODA, 2018)

Random linear binary codes have smaller list sizes than uniformly random binary codes. - Ray Li; Mary Wootters (CoRR, 2018)

Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation. - Noah Shutty; Mary Wootters; Patrick Hayden (CoRR, 2018)

Improved decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (Electron. Colloquium Comput. Complex., 2018)

Linear-time list recovery of high-rate expander codes. - Brett Hemenway; Mary Wootters (Inf. Comput., 2018)

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes. - Shubham Chandak; Hanlee Ji; Kedar Tatwawadi; Billy Lau; Jay Mardia; Matthew Kubit; Joachim Neu; Peter Griffin; Mary Wootters; Tsachy Weissman (Allerton, 2019)

Unconstraining Graph-Constrained Group Testing. - Bruce Spang; Mary Wootters (APPROX-RANDOM, 2019)

A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques. - Tony F. Wu; Binh Q. Le; Robert M. Radway; Andrew Bartolo; William Hwang; Seungbin Jeong; Haitong Li; Pulkit Tandon; Elisa Vianello; Pascal Vivet; Etienne Nowak; Mary Wootters; et al. (ISSCC, 2019)

Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning. - Rawad Bitar; Mary Wootters; Salim El Rouayheb (ITW, 2019)

Lifted Multiplicity Codes. - Ray Li; Mary Wootters (CoRR, 2019)

LDPC Codes Achieve List-Decoding Capacity. - Jonathan Mosheiff; Nicolas Resch; Noga Ron-Zewi; Shashwat Silas; Mary Wootters (Electron. Colloquium Comput. Complex., 2019)

The N3XT Approach to Energy-Efficient Abundant-Data Computing. - Mohamed M. Sabry Aly; Tony F. Wu; Andrew Bartolo; Yash H. Malviya; William Hwang; Gage Hills; Igor L. Markov; Mary Wootters; Max M. Shulaker; H.-S. Philip Wong; Subhasish Mitra (Proc. IEEE, 2019)

A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording. - Dante Gabriel Muratore; Pulkit Tandon; Mary Wootters; E. J. Chichilnisky; Subhasish Mitra; Boris Murmann (IEEE Trans. Biomed. Circuits Syst., 2019)

Blind Joint MIMO Channel Estimation and Decoding. - Thomas R. Dean; Mary Wootters; Andrea J. Goldsmith (IEEE Trans. Inf. Theory, 2019)

On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. - Huseyin A. Inan; Peter Kairouz; Mary Wootters; Ayfer Özgür (IEEE Trans. Inf. Theory, 2019)

Repairing Multiple Failures for Scalar MDS Codes. - Jay Mardia; Burak Bartan; Mary Wootters (IEEE Trans. Inf. Theory, 2019)

Fast Blind MIMO Decoding Through Vertex Hopping. - Thomas R. Dean; Jonathan Perlstein; Mary Wootters; Andrea J. Goldsmith (IEEE Trans. Wirel. Commun., 2019)

Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise. - Noah Shutty; Mary Wootters; Patrick Hayden (FOCS, 2020)

Sparse Recovery for Orthogonal Polynomial Transforms. - Anna C. Gilbert; Albert Gu; Christopher Ré; Atri Rudra; Mary Wootters (ICALP, 2020)

Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes. - Shubham Chandak; Joachim Neu; Kedar Tatwawadi; Jay Mardia; Billy Lau; Matthew Kubit; Reyna Hulett; Peter Griffin; Mary Wootters; Tsachy Weissman; Hanlee Ji (ICASSP, 2020)

List-Decodability of Structured Ensembles of Codes (Invited Talk). - Mary Wootters (MFCS, 2020)

Asynchronous Distributed Optimization with Randomized Delays. - Margalit Glasgow; Mary Wootters (CoRR, 2020)

High-Probability List-Recovery, and Applications to Heavy Hitters. - Dean Doron; Mary Wootters (Electron. Colloquium Comput. Complex., 2020)

Improved List-Decodability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (Electron. Colloquium Comput. Complex., 2020)

Linear-time Erasure List-decoding of Expander Codes. - Noga Ron-Zewi; Mary Wootters; Gilles Zémor (Electron. Colloquium Comput. Complex., 2020)

Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning. - Rawad Bitar; Mary Wootters; Salim El Rouayheb (IEEE J. Sel. Areas Inf. Theory, 2020)

Local List Recovery of High-Rate Tensor Codes and Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (SIAM J. Comput., 2020)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (FOCS, 2021)

Sharp Threshold Rates for Random Codes. - Venkatesan Guruswami; Jonathan Mosheiff; Nicolas Resch; Shashwat Silas; Mary Wootters (ITCS, 2021)

Wedge-Lifted Codes. - Jabari Hastings; Amy Kanne; Ray Li; Mary Wootters (ISIT, 2021)

On Coding for an Abstracted Nanopore Channel for DNA Storage. - Reyna Hulett; Shubham Chandak; Mary Wootters (ISIT, 2021)

On Greedy Approaches to Hierarchical Aggregation. - Alexandra M. Porter; Mary Wootters (ISIT, 2021)

A Note on the Permuted Puzzles Toy Conjecture. - Keller Blackwell; Mary Wootters (CoRR, 2021)

Hermitian-lifted codes. - Hiram H. López; Beth Malmskog; Gretchen L. Matthews; Fernando Piñero-González; Mary Wootters (Des. Codes Cryptogr., 2021)

On the Download Rate of Homomorphic Secret Sharing. - Ingerid Fosli; Yuval Ishai; Victor I. Kolobov; Mary Wootters (IACR Cryptol. ePrint Arch., 2021)

Approximate Gradient Coding With Optimal Decoding. - Margalit Glasgow; Mary Wootters (IEEE J. Sel. Areas Inf. Theory, 2021)

Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. - Simon Foucart; Deanna Needell; Reese Pathak; Yaniv Plan; Mary Wootters (IEEE Trans. Inf. Theory, 2021)

Lifted Multiplicity Codes and the Disjoint Repair Group Property. - Ray Li; Mary Wootters (IEEE Trans. Inf. Theory, 2021)

Improved List-Decodability of Random Linear Binary Codes. - Ray Li; Mary Wootters (IEEE Trans. Inf. Theory, 2021)

Embedded Index Coding. - Alexandra M. Porter; Mary Wootters (IEEE Trans. Inf. Theory, 2021)

Asynchronous Distributed Optimization with Stochastic Delays. - Margalit R. Glasgow; Mary Wootters (AISTATS, 2022)

Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data. - Noah Shutty; Mary Wootters (ITCS, 2022)

Lower bounds on the redundancy of linear codes with disjoint repair groups. - Sankeerth Rao Karingula; Alexander Vardy; Mary Wootters (ISIT, 2022)

Improved batch code lower bounds. - Ray Li; Mary Wootters (ISIT, 2022)

Efficient Capacity-Achieving Codes for General Repeat Channels. - Francisco Pernice; Ray Li; Mary Wootters (ISIT, 2022)

Efficient Near-Optimal Codes for General Repeat Channels. - Francisco Pernice; Ray Li; Mary Wootters (CoRR, 2022)

Bounds for List-Decoding and List-Recovery of Random Linear Codes. - Venkatesan Guruswami; Ray Li; Jonathan Mosheiff; Nicolas Resch; Shashwat Silas; Mary Wootters (IEEE Trans. Inf. Theory, 2022)

Threshold Rates for Properties of Random Codes. - Venkatesan Guruswami; Jonathan Moshieff; Nicolas Resch; Shashwat Silas; Mary Wootters (IEEE Trans. Inf. Theory, 2022)

Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence. - Margalit Glasgow; Colin Wei; Mary Wootters; Tengyu Ma 001 (ICLR, 2023)

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (SIAM J. Comput., 2023)

Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS. - Keller Blackwell; Mary Wootters (ITC, 2024)

A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications. - Keller Blackwell; Mary Wootters (ITCS, 2024)

Improved Construction of Robust Gray Codes. - Dorsa Fathollahi; Mary Wootters (ISIT, 2024)

Viderman's algorithm for quantum LDPC codes. - Anirudh Krishna; Inbal Livni Navon; Mary Wootters (SODA, 2024)

Improved Construction of Robust Gray Code. - Dorsa Fathollahi; Mary Wootters (CoRR, 2024)

Interactive Coding with Small Memory and Improved Rate. - Dorsa Fathollahi; Bernhard Haeupler; Nicolas Resch; Mary Wootters (CoRR, 2024)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? - Dean Doron; Jonathan Mosheiff; Mary Wootters (Electron. Colloquium Comput. Complex., 2024)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (SIAM J. Comput., 2024)

Low-Density Parity-Check Codes Achieve List-Decoding Capacity. - Jonathan Mosheiff; Nicolas Resch; Noga Ron-Zewi; Shashwat Silas; Mary Wootters (SIAM J. Comput., 2024)

Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums. - Roni Con; Noah Shutty; Itzhak Tamo; Mary Wootters (IEEE Trans. Inf. Theory, 2024)

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel. - Francisco Pernice; Oscar Sprumont; Mary Wootters (STOC, 2025)

Robust Gray Codes Approaching the Optimal Rate. - Roni Con; Dorsa Fathollahi; Ryan Gabrys; Mary Wootters; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2025)

Limitations to Computing Quadratic Functions on Reed-Solomon Encoded Data. - Keller Blackwell; Mary Wootters (CoRR, 2025)

Improved Bounds on Access-Redundancy Tradeoffs in Quantized Linear Computations. - Ching-Fang Li; Mary Wootters (CoRR, 2025)