Avraham Ben-Aroya

According to our database, Avraham Ben-Aroya authored at least 23 papers between 2008 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

SIAM J. Comput., 2022

2020

Near-Optimal Erasure List-Decodable Codes.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

Proceedings of the 35th Computational Complexity Conference, 2020

2018

Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2018

Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.

Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2018

A New Approach for Constructing Low-Error, Two-Source Extractors.

Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.

Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2017

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Low-error two-source extractors for polynomial min-entropy.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2016

Explicit two-source extractors for near-logarithmic min-entropy.

Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2016

2014

A Note on Subspace Evasive Sets.

Avraham Ben-Aroya, Igor Shinkar

Chic. J. Theor. Comput. Sci., 2014

2013

Constructing Small-Bias Sets from Algebraic-Geometric Codes.

Avraham Ben-Aroya, Amnon Ta-Shma

Theory Comput., 2013

2012

Better short-seed quantum-proof extractors.

Avraham Ben-Aroya, Amnon Ta-Shma

Theor. Comput. Sci., 2012

Gradual Small-Bias Sample Spaces.

Avraham Ben-Aroya, Gil Cohen

Electron. Colloquium Comput. Complex., 2012

2011

Pseudorandomness and quantum information

Avraham Ben-Aroya

PhD thesis, 2011

Approximate Quantum Error Correction for Correlated Noise.

Avraham Ben-Aroya, Amnon Ta-Shma

IEEE Trans. Inf. Theory, 2011

Competitive analysis of flash memory algorithms.

Avraham Ben-Aroya, Sivan Toledo

ACM Trans. Algorithms, 2011

A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product.

Avraham Ben-Aroya, Amnon Ta-Shma

SIAM J. Comput., 2011

2010

Quantum Expanders: Motivation and Construction.

Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma

Theory Comput., 2010

On the complexity of approximating the diamond norm.

Avraham Ben-Aroya, Amnon Ta-Shma

Quantum Inf. Comput., 2010

A Note on Amplifying the Error-Tolerance of Locally Decodable Codes.

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2010

Local list decoding with a constant number of queries.

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2010

2008

A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs.

Avraham Ben-Aroya, Oded Regev, Ronald de Wolf

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Quantum Expanders: Motivation and Constructions.

Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008