Research output per year
Research output per year
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
Dive into the research topics where Dean Doron is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Almost Chor-Goldreich Sources and Adversarial Random Walks
Doron, D., Moshkovitz, D., Oh, J. & Zuckerman, D., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1-9 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access -
Approximating Iterated Multiplication of Stochastic Matrices in Small Space
Cohen, G., Doron, D., Sberlo, O. & Ta-Shma, A., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 35-45 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Derandomization with Minimal Memory Footprint
Doron, D. & Tell, R., 1 Jul 2023, 38th Computational Complexity Conference, CCC 2023. Ta-Shma, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 264).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
Ben-Aroya, A., Doron, D. & Ta-Shma, A., 1 Jan 2022, In: SIAM Journal on Computing. 51, 2, p. 31-49 19 p.Research output: Contribution to journal › Article › peer-review
-
High-Probability List-Recovery, and Applications to Heavy Hitters
Doron, D. & Wootters, M., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 55. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
Nearly Optimal Pseudorandomness from Hardness
Doron, D., Moshkovitz, D., Oh, J. & Zuckerman, D., 17 Nov 2022, In: Journal of the ACM. 69, 6, p. 1-55 43.Research output: Contribution to journal › Article › peer-review
-
New Near-Linear Time Decodable Codes Closer to the GV Bound
Blanc, G. & Doron, D., 1 Jul 2022, 37th Computational Complexity Conference, CCC 2022. Lovett, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 234).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
On Hitting-Set Generators for Polynomials that Vanish Rarely
Doron, D., Ta-Shma, A. & Tell, R., 1 Dec 2022, In: Computational Complexity. 31, 2, 16.Research output: Contribution to journal › Article › peer-review
-
Error reduction for weighted PRGs against read once branching programs
Cohen, G., Doron, D., Renard, O., Sberlo, O. & Ta-Shma, A., 1 Jul 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 200).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
4 Scopus citations -
Nearly optimal pseudorandomness from hardness
Doron, D., Moshkovitz, D., Oh, J. & Zuckerman, D., 19 Jan 2021, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. Institute of Electrical and Electronics Engineers, p. 1057-1068 12 p. 9317910Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
12 Scopus citations