Mary Wootters

According to our database1, Mary Wootters authored at least 63 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Local List Recovery of High-Rate Tensor Codes and Applications.
SIAM J. Comput., 2020

Linear-time Erasure List-decoding of Expander Codes.
Electron. Colloquium Comput. Complex., 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.
Electron. Colloquium Comput. Complex., 2020

High-Probability List-Recovery, and Applications to Heavy Hitters.
Electron. Colloquium Comput. Complex., 2020

Wedge-Lifted Codes.
CoRR, 2020

Asynchronous Distributed Optimization with Randomized Delays.
CoRR, 2020

Sharp threshold rates for random codes.
CoRR, 2020

Approximate Gradient Coding with Optimal Decoding.
CoRR, 2020

Hermitian-Lifted Codes.
CoRR, 2020

List-Decodability of Structured Ensembles of Codes (Invited Talk).
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Sparse Recovery for Orthogonal Polynomial Transforms.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Bounds for List-Decoding and List-Recovery of Random Linear Codes.
Proceedings of the Approximation, 2020

2019
Fast Blind MIMO Decoding Through Vertex Hopping.
IEEE Trans. Wirel. Commun., 2019

Repairing Multiple Failures for Scalar MDS Codes.
IEEE Trans. Inf. Theory, 2019

On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing.
IEEE Trans. Inf. Theory, 2019

Blind Joint MIMO Channel Estimation and Decoding.
IEEE Trans. Inf. Theory, 2019

A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording.
IEEE Trans. Biomed. Circuits Syst., 2019

The N3XT Approach to Energy-Efficient Abundant-Data Computing.
Proc. IEEE, 2019

LDPC Codes Achieve List-Decoding Capacity.
Electron. Colloquium Comput. Complex., 2019

Weighted matrix completion from non-random, non-uniform sampling patterns.
CoRR, 2019

Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning.
CoRR, 2019

Lifted Multiplicity Codes.
CoRR, 2019

Embedded Index Coding.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques.
Proceedings of the IEEE International Solid- State Circuits Conference, 2019

Unconstraining Graph-Constrained Group Testing.
Proceedings of the Approximation, 2019

Lifted Multiplicity Codes and the Disjoint Repair Group Property.
Proceedings of the Approximation, 2019

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Linear-time list recovery of high-rate expander codes.
Inf. Comput., 2018

Improved decoding of Folded Reed-Solomon and Multiplicity Codes.
Electron. Colloquium Comput. Complex., 2018

Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation.
CoRR, 2018

Random linear binary codes have smaller list sizes than uniformly random binary codes.
CoRR, 2018

Average-radius list-recoverability of random linear codes.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On Taking Advantage of Multiple Requests in Error Correcting Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Load-Balanced Fractional Repetition Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Improved List-Decodability of Random Linear Binary Codes.
Proceedings of the Approximation, 2018

2017
Repairing Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2017

Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals.
IEEE Trans. Inf. Theory, 2017

Can We Access a Database Both Locally and Privately?
IACR Cryptol. ePrint Arch., 2017

Local List Recovery of High-rate Tensor Codes & Applications.
Electron. Colloquium Comput. Complex., 2017

Average-radius list-recovery of random linear codes: it really ties the room together.
CoRR, 2017

Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping.
CoRR, 2017

Locality via Partially Lifted Codes.
Proceedings of the Approximation, 2017

Limitations of piggybacking codes with low substriping.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Repairing multiple failures for scalar MDS codes.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword.
Theory Comput., 2016

One-Bit Compressive Sensing of Dictionary-Sparse Signals.
CoRR, 2016

Strategic Classification.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Local correctability of expander codes.
Inf. Comput., 2015

2014
It'll probably work out: improved list-decoding through random operations.
Electron. Colloquium Comput. Complex., 2014

New constructions of RIP matrices with fast multiplication and fewer rows.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Fast matrix completion without the condition number.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Every list-decodable code for high noise has abundant near-optimal rate puncturings.
Electron. Colloquium Comput. Complex., 2013

On the list decodability of random linear codes with large error rate
CoRR, 2013

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

On the list decodability of random linear codes with large error rates.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Lower bounds for quantized matrix completion.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
1-Bit Matrix Completion
CoRR, 2012

Reusable low-error compressive sampling schemes through privacy.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Recovering simple signals.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011
Public Key Locally Decodable Codes with Short Keys.
Electron. Colloquium Comput. Complex., 2011

2008
Configuration spaces of convex and embedded polygons in the plane
CoRR, 2008


  Loading...