Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Dean
    Last name: Doron
    DBLP: 163/9761
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 10  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li 0006, Amnon Ta-Shma.
    A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic logarithmic-space algorithms for Laplacian solvers.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dean Doron, Amir Sarid, Amnon Ta-Shma.
    On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    Explicit two-source extractors for near-logarithmic min-entropy.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    Low-error two-source extractors for polynomial min-entropy.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Dean Doron, Amir Sarid, Amnon Ta-Shma.
    On approximating the eigenvalues of stochastic matrices in probabilistic logspace.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Dean Doron, Amnon Ta-Shma.
    On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Dean Doron, Amnon Ta-Shma.
    On the de-randomization of space-bounded approximate counting problems.
    Inf. Process. Lett. 2015, Volume 115 (0) 2015
    Show item 1 to 10 of 10  

    Your query returned 10 matches in the database.