| No. |
Title |
Author |
Year |
| 1 |
Derandomization with Minimal Memory Footprint |
Doron, Dean et al. |
2023 |
| 2 |
High-Probability List-Recovery, and Applications to Heavy Hitters |
Doron, Dean et al. |
2022 |
| 3 |
New Near-Linear Time Decodable Codes Closer to the GV Bound |
Blanc, Guy et al. |
2022 |
| 4 |
Error Reduction for Weighted PRGs Against Read Once Branching Programs |
Cohen, Gil et al. |
2021 |
| 5 |
Pseudorandom Generators for Read-Once Monotone Branching Programs |
Doron, Dean et al. |
2021 |
| 6 |
Log-Seed Pseudorandom Generators via Iterated Restrictions |
Doron, Dean et al. |
2020 |
| 7 |
Near-Optimal Erasure List-Decodable Codes |
Ben-Aroya, Avraham et al. |
2020 |
| 8 |
On Hitting-Set Generators for Polynomials That Vanish Rarely |
Doron, Dean et al. |
2020 |
| 9 |
Spectral Sparsification via Bounded-Independence Sampling |
Doron, Dean et al. |
2020 |
| 10 |
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas |
Doron, Dean et al. |
2019 |
| 11 |
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions |
Ben-Aroya, Avraham et al. |
2019 |
| 12 |
A New Approach for Constructing Low-Error, Two-Source Extractors |
Ben-Aroya, Avraham et al. |
2018 |
| 13 |
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers |
Doron, Dean et al. |
2017 |
