default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvraham Ben-Aroya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Avraham Ben-Aroya, Dean Doron
, Amnon Ta-Shma:
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy. SIAM J. Comput. 51(2): 17-31 (2022)- 2020
- [c10]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Erasure List-Decodable Codes. CCC 2020: 1:1-1:27
2010 – 2019
- 2019
- [c9]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. APPROX-RANDOM 2019: 43:1-43:20 - 2018
- [c8]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A New Approach for Constructing Low-Error, Two-Source Extractors. CCC 2018: 3:1-3:19 - [i9]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - [i8]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c7]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. STOC 2017: 1185-1194 - [i7]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i6]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Explicit two-source extractors for near-logarithmic min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - [i5]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Low-error two-source extractors for polynomial min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [j8]Avraham Ben-Aroya, Igor Shinkar:
A Note on Subspace Evasive Sets. Chic. J. Theor. Comput. Sci. 2014 (2014) - 2013
- [j7]Avraham Ben-Aroya, Amnon Ta-Shma:
Constructing Small-Bias Sets from Algebraic-Geometric Codes. Theory Comput. 9: 253-272 (2013) - 2012
- [j6]Avraham Ben-Aroya, Amnon Ta-Shma:
Better short-seed quantum-proof extractors. Theor. Comput. Sci. 419: 17-25 (2012) - [i4]Avraham Ben-Aroya, Gil Cohen:
Gradual Small-Bias Sample Spaces. Electron. Colloquium Comput. Complex. TR12 (2012) - [i3]Avraham Ben-Aroya, Igor Shinkar:
A Note on Subspace Evasive Sets. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b1]Avraham Ben-Aroya:
Pseudorandomness and quantum information. Tel Aviv University, Israel, 2011 - [j5]Avraham Ben-Aroya, Amnon Ta-Shma:
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. SIAM J. Comput. 40(2): 267-290 (2011) - [j4]Avraham Ben-Aroya, Sivan Toledo:
Competitive analysis of flash memory algorithms. ACM Trans. Algorithms 7(2): 23:1-23:37 (2011) - [j3]Avraham Ben-Aroya, Amnon Ta-Shma:
Approximate Quantum Error Correction for Correlated Noise. IEEE Trans. Inf. Theory 57(6): 3982-3988 (2011) - 2010
- [j2]Avraham Ben-Aroya, Amnon Ta-Shma:
On the complexity of approximating the diamond norm. Quantum Inf. Comput. 10(1&2): 77-86 (2010) - [j1]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Construction. Theory Comput. 6(1): 47-79 (2010) - [c6]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
Local List Decoding with a Constant Number of Queries. FOCS 2010: 715-722 - [i2]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
Local list decoding with a constant number of queries. Electron. Colloquium Comput. Complex. TR10 (2010) - [i1]Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Avraham Ben-Aroya, Amnon Ta-Shma:
Constructing Small-Bias Sets from Algebraic-Geometric Codes. FOCS 2009: 191-197 - 2008
- [c4]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Constructions. CCC 2008: 292-303 - [c3]Avraham Ben-Aroya, Oded Regev, Ronald de Wolf:
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS 2008: 477-486 - [c2]Avraham Ben-Aroya, Amnon Ta-Shma:
A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334 - 2006
- [c1]Avraham Ben-Aroya, Sivan Toledo:
Competitive Analysis of Flash-Memory Algorithms. ESA 2006: 100-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
