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
-
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 Access -
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
-
Small-Space Spectral Sparsification via Bounded-Independence Sampling
Doron, D., Murtagh, J., Vadhan, S. & Zuckerman, D., 14 Mar 2024, In: ACM Transactions on Computation Theory. 16, 2, 7.Research output: Contribution to journal › Article › peer-review
Open Access -
When Do Low-Rate Concatenated Codes Approach The Gilbert–Varshamov Bound?
Doron, D., Mosheiff, J. & Wootters, M., 1 Sep 2024, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Kumar, A. & Ron-Zewi, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 53. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 317).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
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 Access1 Scopus citations -
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
Open Access4 Scopus citations -
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
2 Scopus citations -
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
1 Scopus citations -
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
4 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
3 Scopus citations
Projects
- 1 Finished
-
Advancing Coding Theory Through the Lens of Pseudorandomness
Postigo, J. J. C. (PI), Doron, D. (PI) & Wootters, M. (CoPI)
United States-Israel Binational Science Foundation (BSF)
1/11/20 → 31/05/23
Project: Research