Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Amnon
    Last name: Ta-Shma
    DBLP: t/AmnonTaShma
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 93  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Amnon Ta-Shma.
    Explicit, almost optimal, epsilon-balanced codes.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li 0006, Amnon Ta-Shma.
    A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic logarithmic-space algorithms for Laplacian solvers.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dean Doron, Amir Sarid, Amnon Ta-Shma.
    On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace.
    Computational Complexity 2017, Volume 26 (0) 2017
    Conference paper
    Amnon Ta-Shma.
    Explicit, almost optimal, epsilon-balanced codes.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    Explicit two-source extractors for near-logarithmic min-entropy.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma.
    Low-error two-source extractors for polynomial min-entropy.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Dean Doron, Amir Sarid, Amnon Ta-Shma.
    On approximating the eigenvalues of stochastic matrices in probabilistic logspace.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma.
    Provable Unlinkability Against Traffic Analysis with Low Message Overhead.
    J. Cryptology 2015, Volume 28 (0) 2015
    Conference paper
    Dean Doron, Amnon Ta-Shma.
    On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Dean Doron, Amnon Ta-Shma.
    On the de-randomization of space-bounded approximate counting problems.
    Inf. Process. Lett. 2015, Volume 115 (0) 2015
    Conference paper
    Amnon Ta-Shma, Uri Zwick.
    Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences.
    ACM Transactions on Algorithms 2014, Volume 10 (0) 2014
    Conference paper
    Efraim Gelman, Amnon Ta-Shma.
    The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent.
    34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India 2014 (0) 2014
    Journal article
    Avraham Ben-Aroya, Amnon Ta-Shma.
    Constructing Small-Bias Sets from Algebraic-Geometric Codes.
    Theory of Computing 2013, Volume 9 (0) 2013
    Conference paper
    Amnon Ta-Shma.
    Inverting well conditioned matrices in quantum logspace.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Conference paper
    Gil Cohen, Amnon Ta-Shma.
    Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Journal article
    Avraham Ben-Aroya, Amnon Ta-Shma.
    Better short-seed quantum-proof extractors.
    Theor. Comput. Sci. 2012, Volume 419 (0) 2012
    Conference paper
    Amnon Ta-Shma, Christopher Umans.
    Better Condensers and New Extractors from Parvaresh-Vardy Codes.
    Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 2012 (0) 2012
    Conference paper
    Rotem Arnon Friedman, Esther Hänggi, Amnon Ta-Shma.
    Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström.
    A New Implementation of a Dual (Paper and Cryptographic) Voting System.
    5th International Conference on Electronic Voting 2012, (EVOTE 2012), Co-organized by the Council of Europe, Gesellschaft für Informatik and E-Voting.CC, July 11-14, 2012, Castle Hofen, Bregenz, Austria 2012 (0) 2012
    Journal article
    Rotem Arnon Friedman, Amnon Ta-Shma.
    On the limits of privacy amplification against non-signalling memory attacks
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Avraham Ben-Aroya, Amnon Ta-Shma.
    A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Avraham Ben-Aroya, Amnon Ta-Shma.
    Approximate Quantum Error Correction for Correlated Noise.
    IEEE Transactions on Information Theory 2011, Volume 57 (0) 2011
    Show item 1 to 25 of 93  

    Your query returned 93 matches in the database.