Dean Doron

Postdoctoral Researcher
Dean Doron is a postdoctoral scholar in theoretical computer science at UT Austin, hosted by Dana Moshkovitz and David Zuckerman. Before coming to Austin, he was a PhD student in Tel-Aviv University's CS Theory Group where Amnon Ta-Shma was his advisor. Prior to coming to Tel-Aviv he received his BSc in Computer Science from the Technion.


Research Interests: 
  • Theory of Computing
  • Complexity theory
  • Randomness in computation and explicit constructions
  • Pseudorandomness
  • Derandomization
  • Space-bounded computations


Select Publications

Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li and Amnon Ta-Shma. 2018. A New Approach for Constructing Low-Error, Two-Source Extractors. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Dean Doron, François Le Gall, and Amnon Ta-Shma. 2017. Probabilistic logarithmic-space algorithms for Laplacian solvers. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma. 19 June 2017. An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. ACM. New York, NY.
Dean Doron, Amir Sarid, and Amnon Ta-Shma. December 2016. On approximating the eigenvalues of stochastic matrices in probabilistic logspace. Springer International Publishing. 393-420.
Dean Doron and Amnon Ta-Shma. March 2015. On the de-randomization of space-bounded approximate counting problems. Elsevier.