( en | de | ru )

 

Disambiguation of "Ben-Aroya, Avraham"

Author of the publication

copydeleteadd this publication to your clipboard
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.

, , and . STOC, page 1185-1194. ACM, (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. You can also use the button next to the name to display some publications already assigned to the person.

Avraham Ehrlich

Avraham Milgram

Ben Koch

Ben Elsner

Ben Schacher

 

Other publications of authors with the same name

Explicit two-source extractors for near-logarithmic min-entropy., , and . Electron. Colloquium Comput. Complex., (2016)Gradual Small-Bias Sample Spaces., and . Electron. Colloquium Comput. Complex., (2012)Better short-seed quantum-proof extractors., and . Theor. Comput. Sci., (2012)A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product., and . SIAM J. Comput., 40 (2): 267-290 (2011)Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends., , and . Electron. Colloquium Comput. Complex., (2018)Local List Decoding with a Constant Number of Queries., , and . FOCS, page 715-722. IEEE Computer Society, (2010)Quantum Expanders: Motivation and Constructions., , and . CCC, page 292-303. IEEE Computer Society, (2008)A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate., , , , and . Electron. Colloquium Comput. Complex., (2017)A Note on Amplifying the Error-Tolerance of Locally Decodable Codes., , and . Electron. Colloquium Comput. Complex., (2010)An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy., , and . SIAM J. Comput., 51 (2): 17-31 (2022)