High-Probability List-Recovery, and Applications to Heavy Hitters | 0 | 0.34 | 2022 |
New Near-Linear Time Decodable Codes Closer to the GV Bound | 0 | 0.34 | 2022 |
Error Reduction for Weighted PRGs Against Read Once Branching Programs. | 0 | 0.34 | 2021 |
Pseudorandom Generators for Read-Once Monotone Branching Programs. | 0 | 0.34 | 2021 |
Spectral Sparsification via Bounded-Independence Sampling. | 0 | 0.34 | 2020 |
Near-Optimal Erasure List-Decodable Codes. | 0 | 0.34 | 2020 |
Log-Seed Pseudorandom Generators via Iterated Restrictions. | 0 | 0.34 | 2019 |
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. | 0 | 0.34 | 2018 |
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. | 0 | 0.34 | 2017 |
Low-error two-source extractors for polynomial min-entropy. | 0 | 0.34 | 2016 |
Explicit two-source extractors for near-logarithmic min-entropy. | 2 | 0.36 | 2016 |