| 2026 | ICALP | Tracing AG Codes: Toward Meeting the Gilbert-Varshamov Bound. | Gil Cohen, Dean Doron, Noam Goldgraber, Tomer Manket |
| 2025 | STOC | When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. | Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams |
| 2024 | STOC | Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. | Dean Doron, Edward Pyne, Roei Tell |
| 2023 | STOC | Approximating Iterated Multiplication of Stochastic Matrices in Small Space. | Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma |
| 2023 | STOC | Almost Chor-Goldreich Sources and Adversarial Random Walks. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2022 | ICALP | High-Probability List-Recovery, and Applications to Heavy Hitters. | Dean Doron, Mary Wootters |
| 2020 | FOCS | Nearly Optimal Pseudorandomness From Hardness. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2020 | ICALP | Spectral Sparsification via Bounded-Independence Sampling. | Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman |
| 2017 | STOC | An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
| 2015 | ICALP | On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. | Dean Doron, Amnon Ta-Shma |