Amnon Ta‐Shma

Tel Aviv University — Israel

Computer Science · Physical Sciences

34h-index3.6kcitations124works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(41), Cryptography and Data Security(37), Quantum Computing Algorithms and Architecture(36), Quantum Information and Cryptography(26), Coding theory and cryptography(21)

Publications124 total

HDX Condensers
2023· 3 cited
Approximating Iterated Multiplication of Stochastic Matrices in Small Space
2023· 4 citedOpen Access
On Hitting-Set Generators for Polynomials that Vanish Rarely
Computational Complexity·2022
Expander Random Walks: The General Case and Limitations
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 2 citedOpen Access
Foreword
2021
Expander random walks: a Fourier-analytic approach
2021· 2 cited
Error Reduction for Weighted PRGs Against Read Once Branching Programs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
List-Decoding with Double Samplers
SIAM Journal on Computing·2021· 7 citedOpen Access
Near-optimal erasure list-decodable codes
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 8 citedOpen Access
Pr-ZSUBEXP is not contained in Pr-RP.
Electron. Colloquium Comput. Complex.·2020
On Hitting-Set Generators for Polynomials That Vanish Rarely
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020Open Access
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
SIAM Journal on Computing·2019· 3 cited
On the Entropy Loss and Gap of Condensers
ACM Transactions on Computation Theory·2019· 2 cited
List Decoding with Double Samplers
Society for Industrial and Applied Mathematics eBooks·2019· 2 citedOpen Access
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends.
Electron. Colloquium Comput. Complex.·2018· 1 cited
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.
Electron. Colloquium Comput. Complex.·2018· 2 cited
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
2017· 9 cited
Explicit, almost optimal, epsilon-balanced codes
2017
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 2 citedOpen Access
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex.·2017· 3 cited
page 1 of 7Next →

Frequent Co-authors

David Zuckerman(6), Umesh Vazirani(5), Ronen Shaltiel(5), Dorit Aharonov(4), Andris Ambainis(4), Ashwin Nayak(4), Avraham Ben-Aroya(4), Christopher Umans(3), Tomas Sander(3), Dan Gutfreund(3), Avi Wigderson(3), Jaikumar Radhakrishnan(2), Sean Hallgren(2), Alexander Russell(2), Uri Zwick(2), Hartmut Klauck(2), Leonard J. Schulman(2), Ben Riva(2), Tal Moran(2), Roy Armoni(2)