#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2014

2017

- This year (8)
- Last 5 years (15)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dean Doron, Amnon Ta-Shma
- ICALP
- 2015

We introduce the problem of approximating the eigenvalues of a given stochastic/symmetric matrix in the context of classical spacebounded computation. The problem can be exactly solved in DET âŠ† NC.â€¦ (More)

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

The breakthrough result of Chattopadhyay and Zuckerman (2016) gives a reduction from the construction of explicit two-source extractors to the construction of explicit non-malleable extractors.â€¦ (More)

- Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
- Electronic Colloquium on Computational Complexity
- 2016

We explicitly construct extractors for two independent n-bit sources of (log n) minentropy. Previous constructions required either polylog(n) min-entropy [CZ15, Mek15] or five sources [Coh16]. Ourâ€¦ (More)

- Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
- Electronic Colloquium on Computational Complexity
- 2017

We show a reduction from the existence of explicit t-non-malleable extractors with a small seed length, to the construction of explicit two-source extractors with small error for sources withâ€¦ (More)

- Dean Doron, Amir Sarid, Amnon Ta-Shma
- computational complexity
- 2016

We show that approximating the second eigenvalue of stochastic operators is BPL-complete, thus giving a natural problem complete for this class. We also show that approximating any eigenvalue of aâ€¦ (More)

- Dean Doron, Amnon Ta-Shma
- Inf. Process. Lett.
- 2015

It was recently shown that SVD and matrix inversion can be approximated in quantum log-space [1] for well formed matrices. This can be interpreted as a fully logarithmic quantum approximation schemeâ€¦ (More)

- Dean Doron, FranÃ§ois Le Gall, Amnon Ta-Shma
- APPROX-RANDOM
- 2017

A recent series of breakthroughs initiated by Spielman and Teng culminated in the construction of nearly linear time Laplacian solvers, approximating the solution of a linear system Lx = b, where Lâ€¦ (More)

- Amnon Ta-Shma, Dean Doron
- 2016

The ultimate goal we have is separating classes (or proving they are equal if they are). But our success so far seems to be limited: We know a (quite) tight time hierarchy, a tight space hierarchy,â€¦ (More)

- Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
- Electronic Colloquium on Computational Complexity
- 2016

The aim of this paper was to present a new two-source extractor for min-entropy nÎ± for some Î± < 1 having exponentially-small error. Say we are given two independent sources X and Y . The techniqueâ€¦ (More)

- Amnon Ta-Shma, Dean Doron
- 2017