( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.

, , , , и . Electron. Colloquium Comput. Complex., (2017)

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.

Doron Lahav

Doron Merkler

Julien DeAntoni

tefan Dorondel

Graham Deane

 

Другие публикации лиц с тем же именем

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace., и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 419-431. Springer, (2015)On the de-randomization of space-bounded approximate counting problems., и . Inf. Process. Lett., 115 (10): 750-753 (2015)Nearly Optimal Pseudorandomness from Hardness., , , и . 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., , , , и . Electron. Colloquium Comput. Complex., (2017)An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy., , и . SIAM J. Comput., 51 (2): 17-31 (2022)High-Probability List-Recovery, and Applications to Heavy Hitters., и . ICALP, том 229 из LIPIcs, стр. 55:1-55:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A New Approach for Constructing Low-Error, Two-Source Extractors., , , , и . CCC, том 102 из LIPIcs, стр. 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On approximating the eigenvalues of stochastic matrices in probabilistic logspace., , и . Electron. Colloquium Comput. Complex., (2016)Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends., , и . Electron. Colloquium Comput. Complex., (2018)Almost Chor-Goldreich Sources and Adversarial Random Walks., , , и . STOC, стр. 1-9. ACM, (2023)