Name
Papers
Collaborators
MARY WOOTTERS
63
110
Citations 
PageRank 
Referers 
172
25.99
379
Referees 
References 
613
430
Search Limit
100613
Title
Citations
PageRank
Year
High-Probability List-Recovery, and Applications to Heavy Hitters00.342022
Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data.00.342022
Improved batch code lower bounds00.342022
On the Download Rate of Homomorphic Secret Sharing.00.342022
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]00.342021
Approximate Gradient Coding With Optimal Decoding00.342021
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns00.342021
Lifted Multiplicity Codes and the Disjoint Repair Group Property00.342021
On the Download Rate of Homomorphic Secret Sharing.00.342021
Sharp threshold rates for random codes00.342021
Sparse Recovery for Orthogonal Polynomial Transforms00.342020
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise00.342020
Linear-Time Erasure List-Decoding of Expander Codes00.342020
Local List Recovery of High-rate Tensor Codes and Applications10.352020
Bounds for list-decoding and list-recovery of random linear codes00.342020
LDPC Codes Achieve List Decoding Capacity10.382020
List-Decodability of Structured Ensembles of Codes (Invited Talk).00.342020
Lifted Multiplicity Codes and the Disjoint Repair Group Property.00.342019
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes00.342019
Embedded Index Coding10.352019
Lifted Multiplicity Codes.00.342019
The N3XT Approach to Energy-Efficient Abundant-Data Computing.00.342019
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning10.472019
LDPC Codes Achieve List-Decoding Capacity.00.342019
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording.20.352019
Fast Blind MIMO Decoding through Vertex Hopping00.342019
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning20.442019
14.3 A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques00.342019
Improved List-Decodability of Random Linear Binary Codes10.382018
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes00.342018
Blind Joint MIMO Channel Estimation and Decoding.10.472018
Load-Balanced Fractional Repetition Codes00.342018
Unconstraining graph-constrained group testing.00.342018
Average-radius list-recoverability of random linear codes.00.342018
Repairing Multiple Failures for Scalar MDS Codes.110.712018
Random linear binary codes have smaller list sizes than uniformly random binary codes.00.342018
Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation.00.342018
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing.40.402018
Fast Blind MIMO Decoding through Vertex Hopping00.342018
On Taking Advantage of Multiple Requests in Error Correcting Codes00.342018
Limitations of piggybacking codes with low substriping.00.342017
Locality via Partially Lifted Codes.00.342017
Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping.00.342017
Local List Recovery of High-Rate Tensor Codes & Applications50.412017
Exponential decay of reconstruction error from binary measurements of sparse signals.250.842017
Average-radius list-recovery of random linear codes: it really ties the room together.00.342017
Can We Access a Database Both Locally and Privately?00.342017
One-Bit Compressive Sensing Of Dictionary-Sparse Signals60.462016
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword.00.342016
Strategic Classification.00.342016
  • 1
  • 2