Quantum Expanders: Motivation and Constructions. - Avraham Ben-Aroya; Oded Schwartz; Amnon Ta-Shma (CCC, 2008)

A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. - Avraham Ben-Aroya; Oded Regev 001; Ronald de Wolf (FOCS, 2008)

Local list decoding with a constant number of queries. - Avraham Ben-Aroya; Klim Efremenko; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 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)

On the complexity of approximating the diamond norm. - Avraham Ben-Aroya; Amnon Ta-Shma (Quantum Inf. Comput., 2010)

Quantum Expanders: Motivation and Construction. - Avraham Ben-Aroya; Oded Schwartz; Amnon Ta-Shma (Theory Comput., 2010)

A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. - Avraham Ben-Aroya; Amnon Ta-Shma (SIAM J. Comput., 2011)

Competitive analysis of flash memory algorithms. - Avraham Ben-Aroya; Sivan Toledo (ACM Trans. Algorithms, 2011)

Approximate Quantum Error Correction for Correlated Noise. - Avraham Ben-Aroya; Amnon Ta-Shma (IEEE Trans. Inf. Theory, 2011)

Pseudorandomness and quantum information - Avraham Ben-Aroya (2011)

Gradual Small-Bias Sample Spaces. - Avraham Ben-Aroya; Gil Cohen (Electron. Colloquium Comput. Complex., 2012)

Better short-seed quantum-proof extractors. - Avraham Ben-Aroya; Amnon Ta-Shma (Theor. Comput. Sci., 2012)

Constructing Small-Bias Sets from Algebraic-Geometric Codes. - Avraham Ben-Aroya; Amnon Ta-Shma (Theory Comput., 2013)

A Note on Subspace Evasive Sets. - Avraham Ben-Aroya; Igor Shinkar (Chic. J. Theor. Comput. Sci., 2014)

Explicit two-source extractors for near-logarithmic min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2016)

Low-error two-source extractors for polynomial min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2016)

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (STOC, 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 006; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

A New Approach for Constructing Low-Error, Two-Source Extractors. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (CCC, 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)

Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2018)

Near-Optimal Erasure List-Decodable Codes. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (CCC, 2020)

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)