Amnon Ta-Shma

Institute of Computer Science, Hebrew University of Jerusalem

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers93 papers

Sort

By YearBy Citation

Near-Optimal Erasure List-Decodable Codes

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

CCC, pp.27, (2020)

EIBibtex

On Hitting-Set Generators for Polynomials that Vanish Rarely

Dean Doron,Amnon Ta-Shma, Roei Tell

Electronic Colloquium on Computational Complexity (ECCC), (2019): 119

Cited by1EIBibtex

On the Entropy Loss and Gap of Condensers

Nir Aviv,Amnon Ta-Shma

ACM Transactions on Computation Theory, no. 3 (2019): 1-14

EIBibtex

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

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

CCC, pp.3:1-3:19, (2018)

Cited by6EIBibtex

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

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

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by1EIBibtex

List Decoding with Double Samplers

Irit Dinur,Prahladh Harsha,Tali Kaufman, Inbal Livni Navon,Amnon Ta-Shma

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, (2018): 2134-2153

Cited by11EIBibtex

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

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

international workshop and international workshop on approximation, randomization, and combinatorial..., (2018)

EIBibtex

Probabilistic logarithmic-space algorithms for Laplacian solvers

Dean Doron,Francois Le Gall,Amnon Ta-Shma

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by1EIBibtex

On approximating the eigenvalues of stochastic matrices in probabilistic logspace

Dean Doron, Amir Sarid,Amnon Ta-Shma

Computational Complexity, no. 2 (2017): 393-420

Cited by8EIBibtex

Explicit, almost optimal, epsilon-balanced codes

Amnon Ta-Shma

Electronic Colloquium on Computational Complexity (ECCC), (2017): 238-251

Cited by22EIBibtex

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

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

STOC, pp.1185-1194, (2017)

Cited by15EIBibtex

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

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by1EIBibtex

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

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

Electronic Colloquium on Computational Complexity (ECCC), (2016)

Cited by1EIBibtex

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

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

Electronic Colloquium on Computational Complexity (ECCC), (2016)

Cited by18EIBibtex

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace

Dean Doron,Amnon Ta-Shma

ICALP, pp.419-431, (2015)

Cited by4EIBibtex

On the de-randomization of space-bounded approximate counting problems

Dean Doron,Amnon Ta-Shma

Information Processing Letters, no. 10 (2015): 750-753

Cited by2EIBibtex

Orthography and Biblical Criticism

Idan Dershowitz,Nachum Dershowitz, Tomer Hasid,Amnon Ta-Shma

DH, (2014)

EIBibtex

Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

Amnon Ta-shma,Uri Zwick

ACM Transactions on Algorithms, no. 3 (2014)

Cited by36EIBibtex

Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Ron Berman,Amos Fiat,Marcin Gomulkiewicz,Marek Klonowski,Miroslaw Kutylowski,Tomer Levinboim,Amnon Ta-Shma

Journal of Cryptology, no. 3 (2013)

Cited by5EIBibtex

Avraham Ben-aroya

Avraham Benaroya,Amnon Tashma

(2013)

Bibtex

View All

Base Info Papers Patents Projects