Personal profile
Research interests
My research lies within Theory of Computation, mainly computational complexity, randomness in computation and explicit constructions. More specifically, I am interesterd in pseudorandomness, derandomization, and error-correcting codes.
Before coming to Ben-Gurion, I was a Motwani Postdoctoral Fellow at Stanford and a postdoctoral researcher at UT Austin hosted by Dana Moshkovitz and David Zuckerman. I received my PhD from Tel-Aviv University, where I was fortunate to have Amnon Ta-Shma as my advisor.
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
Bit-Fixing Extractors for Almost-Logarithmic Entropy
Doron, D. & Fridman, O., 15 Sep 2025, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025. Ene, A. & Chattopadhyay, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 353).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Implications of Better PRGs for Permutation Branching Programs
Doron, D. & Hoza, W. M., 15 Sep 2025, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025. Ene, A. & Chattopadhyay, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 353).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
List-Recovery of Random Linear Codes over Small Fields
Doron, D., Mosheiff, J., Resch, N. & Ribeiro, J., 15 Sep 2025, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025. Ene, A. & Chattopadhyay, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 353).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
List-Recovery of Random Linear Codes Over Small Fields
Doron, D., Mosheiff, J., Resch, N. & Ribeiro, J., 1 Jan 2025, In: IEEE Transactions on Information Theory. 71, 12, p. 9548-9562 15 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Nearly-Linear Time Seeded Extractors With Short Seeds
Doron, D. & Ribeiro, J., 1 Jan 2025, In: IEEE Transactions on Information Theory. 71, 11, p. 9028-9054 27 p.Research output: Contribution to journal › Article › peer-review
-
Online Condensing of Unpredictable Sources via Random Walks
Doron, D., Moshkovitz, D., Oh, J. & Zuckerman, D., 29 Jul 2025, 40th Computational Complexity Conference, CCC 2025. Srinivasan, S. & Srinivasan, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 339).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
Seed-Protecting Extractors
Cohen, G., Doron, D. & Samocha, S., 1 Jan 2025, In: Theory of Computing. 21, 8Research output: Contribution to journal › Article › peer-review
-
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism
Doron, D., Pyne, E., Tell, R. & Williams, R. R., 15 Jun 2025, STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucky, M. & Bansal, N. (eds.). Association for Computing Machinery, p. 1108-1117 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL
Doron, D., Pyne, E. & Tell, R., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 2039-2049 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access13 Scopus citations -
SIGACT News Complexity Theory Column: Binary Codes with Distance Close to Half
Doron, D., Sep 2024, In: SIGACT News. 55, 3, p. 33-51Research output: Contribution to journal › Article › peer-review
Projects
- 2 Active
-
Derandomization of Space-Bounded Computation and the Minimal-Overhead Derandomization Challenge
Doron, D. (PI)
1/01/25 → 31/12/29
Project: Research
-
Advancing Coding Theory Through the Lens of Pseudorandomness
Postigo, J. C. (PI), Doron, D. (PI) & Wootters, M. (CoPI)
United States-Israel Binational Science Foundation (BSF)
1/11/20 → 31/05/26
Project: Research