Mary Wootters

Q: What Schools Are Affiliated With Mary Wootters

Mary Wootters is affiliated with the following schools: University of Michigan, Stanford University

Mary Wootters's AcademicInfluence.com Rankings

Mary Wootters

Computer Science

#5923

World Rank

#6247

Historical Rank

computer-science Degrees

Mary Wootters

Mathematics

#5454

World Rank

#7672

Historical Rank

Measure Theory

#4262

World Rank

#5021

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Mary Wootters's Degrees

PhD Electrical Engineering Stanford University

Why Is Mary Wootters Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mary Katherine Wootters is an American coding theorist, information theorist, and theoretical computer scientist. She is an assistant professor of computer science and electrical engineering and a member of the Institute for Computational and Mathematical Engineering at Stanford University.

(See a Problem?)

Mary Wootters's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

1-Bit Matrix Completion (2012) (307)
Strategic Classification (2015) (232)
Repairing Reed-Solomon Codes (2015) (134)
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals (2014) (109)
Fast matrix completion without the condition number (2014) (101)
The N3XT Approach to Energy-Efficient Abundant-Data Computing (2019) (62)
New constructions of RIP matrices with fast multiplication and fewer rows (2012) (50)
Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning (2019) (48)
Every list-decodable code for high noise has abundant near-optimal rate puncturings (2013) (46)
Local correctability of expander codes (2013) (44)
Can We Access a Database Both Locally and Privately? (2017) (39)
Recovering simple signals (2012) (39)
Repairing multiple failures for scalar MDS codes (2017) (36)
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing (2018) (33)
On the list decodability of random linear codes with large error rates (2013) (31)
One-Bit Compressive Sensing of Dictionary-Sparse Signals (2016) (30)
Linear-Time List Recovery of High-Rate Expander Codes (2015) (29)
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes (2019) (29)
Resistive RAM Endurance: Array-Level Characterization and Correction Techniques Targeting Deep Learning Applications (2019) (28)
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes (2018) (25)
14.3 A 43pJ/Cycle Non-Volatile Microcontroller with 4.7μs Shutdown/Wake-up Integrating 2.3-bit/Cell Resistive RAM and Resilience Techniques (2019) (25)
Locality via Partially Lifted Codes (2017) (25)
LDPC Codes Achieve List Decoding Capacity (2019) (24)
Overcoming High Nanopore Basecaller Error Rates for DNA Storage Via Basecaller-Decoder Integration and Convolutional Codes (2019) (23)
Local List Recovery of High-Rate Tensor Codes & Applications (2017) (22)
Local List Recovery of High-Rate Tensor Codes and Applications (2017) (21)
Improved List-Decodability of Random Linear Binary Codes (2018) (17)
Public Key Locally Decodable Codes with Short Keys (2011) (16)
Biological screens from linear codes: theory and tools (2015) (15)
Average-radius list-recovery of random linear codes: it really ties the room together (2017) (14)
Reusable low-error compressive sampling schemes through privacy (2012) (14)
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording (2019) (13)
Bounds for List-Decoding and List-Recovery of Random Linear Codes (2020) (13)
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing (2013) (13)
Lifted Multiplicity Codes and the Disjoint Repair Group Property (2019) (12)
Embedded Index Coding (2019) (12)
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword (2016) (12)
De-biasing low-rank projection for matrix completion (2017) (12)
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns (2019) (11)
It'll Probably Work Out: Improved List-Decoding Through Random Operations (2014) (11)
Lower bounds on the redundancy of linear codes with disjoint repair groups (2022) (10)
Approximate Gradient Coding With Optimal Decoding (2020) (10)
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning (2019) (9)
Blind Joint MIMO Channel Estimation and Decoding (2017) (9)
Illusion of large on-chip memory by networked computing chips for neural network inference (2021) (8)
Optimal entanglement-assisted one-shot classical communication (2012) (8)
Lifted Multiplicity Codes (2019) (7)
Average-radius list-recoverability of random linear codes (2018) (7)
Linear-time Erasure List-decoding of Expander Codes (2020) (6)
Sharp threshold rates for random codes (2020) (6)
Unconstraining graph-constrained group testing (2018) (6)
A Data-Compressive Wired-OR Readout for Massively Parallel Neural Recording (2019) (5)
Improved List-Decodability of Reed-Solomon Codes via Tree Packings (2020) (5)
On the Download Rate of Homomorphic Secret Sharing (2021) (5)
Repairing Multiple Failures for Scalar MDS Codes (2019) (4)
Sparse Recovery for Orthogonal Polynomial Transforms (2019) (4)
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing (2019) (4)
High-Probability List-Recovery, and Applications to Heavy Hitters (2020) (4)
Hermitian-lifted codes (2020) (4)
Load-Balanced Fractional Repetition Codes (2018) (4)
Improved batch code lower bounds (2021) (3)
Asynchronous Distributed Optimization with Randomized Delays (2020) (3)
Superbridge and bridge indices for knots (2020) (3)
Threshold Rates for Properties of Random Codes (2022) (3)
Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data (2021) (3)
Wedge-Lifted Codes (2020) (3)
Linear-Time Erasure List-Decoding of Expander Codes (2021) (2)
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ∗ (2020) (2)
On Taking Advantage of Multiple Requests in Error Correcting Codes (2018) (2)
Fast Blind MIMO Decoding through Vertex Hopping (2018) (2)
Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation (2018) (2)
A Note on the Permuted Puzzles Toy Conjecture (2021) (2)
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract] (2022) (2)
On Coding for an Abstracted Nanopore Channel for DNA Storage (2021) (2)
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise (2018) (2)
Asynchronous Distributed Optimization with Stochastic Delays (2022) (2)
Configuration spaces of convex and embedded polygons in the plane (2008) (1)
Fast Blind MIMO Decoding Through Vertex Hopping (2019) (1)
Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping (2017) (1)
Limitations of piggybacking codes with low substriping (2017) (1)
Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes. (2014) (1)
Embedded Index Coding (2021) (1)
Efficient Near-Optimal Codes for General Repeat Channels (2022) (1)
Blind Joint MIMO Channel Estimation and Decoding (2019) (1)
Lower bounds for quantized matrix completion (2013) (1)
Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence (2022) (1)
Approximate K Nearest Neighbors in High Dimensions (2008) (0)
Efficient Capacity-Achieving Codes for General Repeat Channels (2022) (0)
D S ] 1 9 Ju l 2 01 9 Sparse Recovery for Orthogonal Polynomial Transforms (2019) (0)
List-Decodability of Structured Ensembles of Codes (2020) (0)
CS265/CME309: Randomized Algorithms and Probabilistic Analysis Lecture #9: Compressed Sensing and the Restricted Isometry Property (2020) (0)
Low-Density Parity-Check Codes Achieve List-Decoding Capacity (2021) (0)
CS265/CME309: Randomized Algorithms and Probabilistic Analysis Lecture #2: Linearity of Expectation, Karger’s Min-Cut Algorithm, and Quicksort with Random Pivot. (2020) (0)
Linear time , high-rate , list-recoverable codes from expander graphs (2015) (0)
Illusion of large on-chip memory by networked computing chips for neural network inference (2021) (0)
Approximate Gradient Coding with Optimal Decoding (2021) (0)
Magnetic DNA random access memory with nanopore readouts and exponentially-scaled combinatorial addressing (2021) (0)
CS265/CME309: Randomized Algorithms and Probabilistic Analysis Lecture #18: A taste of pseudorandomness: extractors and expanders (2020) (0)
Upper bounds on the accuracy of an assisted classical channel (2012) (0)
On Greedy Approaches to Hierarchical Aggregation (2021) (0)
Reliable Computation by Formulas of Noisy AND Gates and Noiseless XOR Gates, with Applications to Quantum Mechanics (2018) (0)
Lecture 13 Longest Common Subsequence , Knapsack , Independent Set (0)
LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume (2021) (0)
1 More on the Bellman-Ford Algorithm (2021) (0)
List-Decodability of Structured Ensembles of Codes (Invited Talk) (2020) (0)
1 . 1 Implementation of Dijkstra ’ s Algorithm (2021) (0)
Random linear binary codes have smaller list sizes than uniformly random binary codes (2018) (0)
Configuration spaces of convex and embedded polygons in the plane (2013) (0)

This paper list is powered by the following services:

Other Resources About Mary Wootters

What Schools Are Affiliated With Mary Wootters?

Mary Wootters is affiliated with the following schools:

Mary Wootters's Academic­Influence.com Rankings

Mary Wootters's Degrees

Why Is Mary Wootters Influential?

Mary Wootters's Published Works

Published Works

Other Resources About Mary Wootters

What Schools Are Affiliated With Mary Wootters?

Mary Wootters's AcademicInfluence.com Rankings