| Nearly optimal pseudorandomness from hardness D Doron, D Moshkovitz, J Oh, D Zuckerman Journal of the ACM 69 (6), 1-55, 2022 | 36 | 2022 |
| An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy A Ben-Aroya, D Doron, A Ta-Shma Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 28 | 2017 |
| Explicit two-source extractors for near-logarithmic min-entropy A Ben-Aroya, D Doron, A Ta-Shma Electronic Colloquium on Computational Complexity (ECCC) 23, 88, 2016 | 25 | 2016 |
| Error reduction for weighted PRGs against read once branching programs G Cohen, D Doron, O Renard, O Sberlo, A Ta-Shma Leibniz international proceedings in informatics 200 (22), 2021 | 15 | 2021 |
| A new approach for constructing low-error, two-source extractors A Ben-Aroya, E Chattopadhyay, D Doron, X Li, A Ta-Shma 33rd Computational Complexity Conference (CCC 2018), 2018 | 15 | 2018 |
| Near-optimal erasure list-decodable codes A Ben-Aroya, D Doron, A Ta-Shma 35th Computational Complexity Conference (CCC 2020), 2020 | 13 | 2020 |
| Two-source condensers with low error and small entropy gap via entropy-resilient functions A Ben-Aroya, G Cohen, D Doron, A Ta-Shma Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 13 | 2019 |
| Probabilistic logarithmic-space algorithms for Laplacian solvers D Doron, F Le Gall, A Ta-Shma Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 13 | 2017 |
| Log-seed pseudorandom generators via iterated restrictions D Doron, P Hatami, WM Hoza 35th Computational Complexity Conference (CCC 2020), 2020 | 11 | 2020 |
| On approximating the eigenvalues of stochastic matrices in probabilistic logspace D Doron, A Sarid, A Ta-Shma computational complexity 26, 393-420, 2017 | 11 | 2017 |
| Near-optimal pseudorandom generators for constant-depth read-once formulas D Doron, P Hatami, WM Hoza 34th Computational Complexity Conference (CCC 2019), 2019 | 10 | 2019 |
| High-probability list-recovery, and applications to heavy hitters D Doron, M Wootters Leibniz international proceedings in informatics, 2022 | 8 | 2022 |
| Pseudorandom generators for read-once monotone branching programs D Doron, R Meka, O Reingold, A Tal, S Vadhan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021 | 6 | 2021 |
| Derandomization with minimal memory footprint D Doron, R Tell 38th Computational Complexity Conference (CCC 2023), 2023 | 5 | 2023 |
| New near-linear time decodable codes closer to the GV bound G Blanc, D Doron 37th Computational Complexity Conference (CCC 2022), 2022 | 5 | 2022 |
| On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace D Doron, A Ta-Shma Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 5 | 2015 |
| Approximating iterated multiplication of stochastic matrices in small space G Cohen, D Doron, O Sberlo, A Ta-Shma Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 35-45, 2023 | 4 | 2023 |
| Spectral sparsification via bounded-independence sampling D Doron, J Murtagh, S Vadhan, D Zuckerman arXiv preprint arXiv:2002.11237, 2020 | 4 | 2020 |
| Monotone branching programs: Pseudorandomness and circuit complexity D Doron, R Meka, O Reingold, A Tal, SP Vadhan Electron. Colloquium Comput. Complex, 18, 2021 | 3 | 2021 |
| On hitting-set generators for polynomials that vanish rarely D Doron, A Ta-Shma, R Tell Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 3 | 2020 |
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
