( en | de | ru )

 

Disambiguation of "Doron, Dean"

Author of the publication

copydeleteadd this publication to your clipboard
A New Approach for Constructing Low-Error, Two-Source Extractors.

, , , , and . CCC, volume 102 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Doron Lahav

Doron Merkler

Julien DeAntoni

tefan Dorondel

Graham Deane

 

Other publications of authors with the same name

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 419-431. Springer, (2015)On the de-randomization of space-bounded approximate counting problems., and . Inf. Process. Lett., 115 (10): 750-753 (2015)An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy., , and . SIAM J. Comput., 51 (2): 17-31 (2022)Nearly Optimal Pseudorandomness from Hardness., , , and . J. ACM, 69 (6): 43:1-43:55 (2022)A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate., , , , and . Electron. Colloquium Comput. Complex., (2017)High-Probability List-Recovery, and Applications to Heavy Hitters., and . ICALP, volume 229 of LIPIcs, page 55:1-55:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A New Approach for Constructing Low-Error, Two-Source Extractors., , , , and . CCC, volume 102 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On approximating the eigenvalues of stochastic matrices in probabilistic logspace., , and . Electron. Colloquium Comput. Complex., (2016)Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends., , and . Electron. Colloquium Comput. Complex., (2018)Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 41:1-41:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)