Mary Wootters
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
- Ingerid Foslionce
- Jonathan Mosheiffonce
- Nicolas Reschonce
all 8 in the filters
who talks about the same things
- Venkatesan Guruswami3 talks
- David P. Woodruff18 talks
- Omer Reingold5 talks
- Yuval Ishai8 talks
- Yuval Filmus9 talks
- Dor Minzer8 talks
| title | conference | date |
|---|---|---|
| Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data | ITCS 2022 | 2022-01-31 |
Shows a concrete scheme for Reed–Solomon codes that computes any linear function λ·f by downloading only o(b) bits, specifically Θ(b / log b) bits when using… | ||
| On the download rate of homomorphic secret sharing | ITCS 2022 | 2022-01-31 |
Proves optimal linear HSS for low-degree polynomials with exact rate 1 - d t / k, gives a PIR instantiation with upload cost n^{1/d} and that download rate… | ||
| Sharp Threshold Rates for Random Codes | ITCS 2021 | 2021-01-06 |
Characterizes exact threshold rates for a wide class of monotone symmetric properties of completely random codes: R = 1 − max_tau H_q(tau)/b, shows these… | ||
| Sharp Thresholds for Random Subspaces, and Applications | Concentration of Measure Phenomena | 2020-10-19 |
Proves a sharp threshold for local properties of uniformly random subspaces over F_q: there's a rate r so dimension below r almost surely avoids any b-sized… | ||
| List Recovery and Local Decoding of Expander Codes | Coding: From Practice to Theory | 2015-02-19 |
Shows that taking a D‑regular Ramanujan expander and an inner code with modest local structure yields an outer Tanner/expander code with concrete guarantees… | ||
| nothing matches | ||