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 93 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
    Conference paper
    Amnon Ta-Shma.
    Short Seed Extractors against Quantum Storage.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Journal article
    Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma.
    A Note on Amplifying the Error-Tolerance of Locally Decodable Codes.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma.
    Local list decoding with a constant number of queries.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Conference paper
    Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma.
    Local List Decoding with a Constant Number of Queries.
    51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA 2010 (0) 2010
    Journal article
    Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma.
    Quantum Expanders: Motivation and Construction.
    Theory of Computing 2010, Volume 6 (0) 2010
    Conference paper
    Avraham Ben-Aroya, Amnon Ta-Shma.
    On the complexity of approximating the diamond norm.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Conference paper
    Amnon Ta-Shma.
    Short seed extractors against quantum storage.
    Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009 (0) 2009
    Conference paper
    Tal Moran, Ronen Shaltiel, Amnon Ta-Shma.
    Non-interactive Timestamping in the Bounded-Storage Model.
    J. Cryptology 2009, Volume 22 (0) 2009
    Conference paper
    Avraham Ben-Aroya, Amnon Ta-Shma.
    Constructing Small-Bias Sets from Algebraic-Geometric Codes.
    50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009 (0) 2009
    Conference paper
    Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma.
    Quantum Expanders: Motivation and Constructions.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Avraham Ben-Aroya, Amnon Ta-Shma.
    A combinatorial construction of almost-ramanujan graphs using the zig-zag product.
    Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008 (0) 2008
    Conference paper
    Ben Riva, Amnon Ta-Shma.
    Bare-Handed Electronic Voting with Pre-processing.
    2007 USENIX/ACCURATE Electronic Voting Technology Workshop, EVT'07, Boston, MA, USA, August 6, 2007 2007 (0) 2007
    Journal article
    Alex Rapaport, Amnon Ta-Shma.
    On the Power of Quantum, One Round, Two Prover Interactive Proof Systems.
    Quantum Information Processing 2007, Volume 6 (0) 2007
    Conference paper
    Dan Gutfreund, Amnon Ta-Shma.
    Worst-Case to Average-Case Reductions Revisited.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Amnon Ta-Shma, Uri Zwick.
    Deterministic rendezvous, treasure hunts and strongly universal exploration sequences.
    Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 2007 (0) 2007
    Conference paper
    Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma.
    If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
    Computational Complexity 2007, Volume 16 (0) 2007
    Conference paper
    Amnon Ta-Shma, Christopher Umans, David Zuckerman.
    Lossless Condensers, Unbalanced Expanders, And Extractors.
    Combinatorica 2007, Volume 27 (0) 2007
    Conference paper
    Dorit Aharonov, Amnon Ta-Shma.
    Adiabatic Quantum State Generation.
    SIAM J. Comput. 2007, Volume 37 (0) 2007
    Conference paper
    Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman.
    Interaction in Quantum Communication.
    IEEE Transactions on Information Theory 2007, Volume 53 (0) 2007
    Conference paper
    Ishay Haviv, Oded Regev 0001, Amnon Ta-Shma.
    On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy.
    Theory of Computing 2007, Volume 3 (0) 2007
    Conference paper
    Amnon Ta-Shma, Christopher Umans.
    Better lossless condensers through derandomized curve samplers.
    47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006 (0) 2006
    Conference paper
    Dan Gutfreund, Amnon Ta-Shma.
    New connections between derandomization, worst-case complexity and average-case complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    Amnon Ta-Shma, David Zuckerman, Shmuel Safra.
    Extractors from Reed-Muller codes.
    J. Comput. Syst. Sci. 2006, Volume 72 (0) 2006
    Conference paper
    Eran Rom, Amnon Ta-Shma.
    Improving the Alphabet-Size in Expander-Based Code Constructions.
    IEEE Transactions on Information Theory 2006, Volume 52 (0) 2006
    Conference paper
    Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma.
    On the Error Parameter of Dispersers.
    Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computat 2005 (0) 2005
    Conference paper
    Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma.
    If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances.
    20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA 2005 (0) 2005
    Conference paper
    Eran Rom, Amnon Ta-Shma.
    Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma.
    On the Error Parameter of Dispersers
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Tal Moran, Ronen Shaltiel, Amnon Ta-Shma.
    Non-interactive Timestamping in the Bounded Storage Model.
    Advances in Cryptology - CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Ron Berman, Amos Fiat, Amnon Ta-Shma.
    Provable Unlinkability against Traffic Analysis.
    Financial Cryptography, 8th International Conference, FC 2004, Key West, FL, USA, February 9-12, 2004. Revised Papers 2004 (0) 2004
    Conference paper
    Eran Rom, Amnon Ta-Shma.
    Improveing the alphabet size in high noise, almost optimal rate list decodable codes
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Amnon Ta-Shma, David Zuckerman.
    Extractor codes.
    IEEE Transactions on Information Theory 2004, Volume 50 (0) 2004
    Conference paper
    Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma.
    Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.
    18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark 2003 (0) 2003
    Conference paper
    Dorit Aharonov, Amnon Ta-Shma.
    Adiabatic quantum state generation and statistical zero knowledge.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma.
    Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.
    Computational Complexity 2003, Volume 12 (0) 2003
    Conference paper
    Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson.
    The Quantum Communication Complexity of Sampling.
    SIAM J. Comput. 2003, Volume 32 (0) 2003
    Conference paper
    Sean Hallgren, Alexander Russell, Amnon Ta-Shma.
    The Hidden Subgroup Problem and Quantum Computation Using Group Representations.
    SIAM J. Comput. 2003, Volume 32 (0) 2003
    Conference paper
    Amnon Ta-Shma.
    Almost Optimal Dispersers.
    Combinatorica 2002, Volume 22 (0) 2002
    Conference paper
    Amnon Ta-Shma.
    Storing information with extractors.
    Inf. Process. Lett. 2002, Volume 83 (0) 2002
    Conference paper
    Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani.
    Dense quantum coding and quantum finite automata.
    J. ACM 2002, Volume 49 (0) 2002
    Conference paper
    Amnon Ta-Shma, David Zuckerman, Shmuel Safra.
    Extractors from Reed-Muller Codes.
    FOCS 2001 (0) 2001
    Conference paper
    Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman.
    Interaction in quantum communication and the complexity of set disjointness.
    STOC 2001 (0) 2001
    Conference paper
    Amnon Ta-Shma, Christopher Umans, David Zuckerman.
    Loss-less condensers, unbalanced expanders, and extractors.
    STOC 2001 (0) 2001
    Conference paper
    Amnon Ta-Shma, David Zuckerman.
    Extractor codes.
    STOC 2001 (0) 2001
    Conference paper
    Amnon Ta-Shma, David Zuckerman, Shmuel Safra.
    Extractors from Reed-Muller Codes
    Electronic Colloquium on Computational Complexity (ECCC) 2001, Volume 8 (0) 2001
    Conference paper
    Tomas Sander, Amnon Ta-Shma, Moti Yung.
    Blind, Auditable Membership Proofs.
    Financial Cryptography, 4th International Conference, FC 2000 Anguilla, British West Indies, February 20-24, 2000, Proceedings 2001 (0) 2000
    Conference paper
    Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao.
    Quantum bit escrow.
    STOC 2000 (0) 2000
    Conference paper
    Sean Hallgren, Alexander Russell, Amnon Ta-Shma.
    Normal subgroup reconstruction and quantum computation using group representations.
    STOC 2000 (0) 2000
    Conference paper
    Ashwin Nayak, Amnon Ta-Shma, David Zuckerman.
    Interaction in Quantum Communication Complexity
    CoRR 2000, Volume 0 (0) 2000
    Conference paper
    Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou.
    An
    J. ACM 2000, Volume 47 (0) 2000
    Conference paper
    Jaikumar Radhakrishnan, Amnon Ta-Shma.
    Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators.
    SIAM J. Discrete Math. 2000, Volume 13 (0) 2000
    Conference paper
    Tomas Sander, Amnon Ta-Shma.
    Auditable, Anonymous Electronic Cash Extended Abstract.
    Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings 1999 (0) 1999
    Conference paper
    Tomas Sander, Amnon Ta-Shma.
    Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems.
    Financial Cryptography, Third International Conference, FC'99, Anguilla, British West Indies, February 1999, Proceedings 1999 (0) 1999
    Conference paper
    Tomas Sander, Amnon Ta-Shma.
    On Anonymous Electronic Cash and Crime.
    Information Security, Second International Workshop, ISW'99, Kuala Lumpur, Malaysia, November 1999, Proceedings 1999 (0) 1999
    Conference paper
    Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani.
    Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata.
    STOC 1999 (0) 1999
    Conference paper
    Noam Nisan, Amnon Ta-Shma.
    Extracting Randomness: A Survey and New Constructions.
    J. Comput. Syst. Sci. 1999, Volume 58 (0) 1999
    Journal article
    Amnon Ta-Shma.
    Classical versus quantum communication complexity.
    SIGACT News 1999, Volume 30 (0) 1999
    Conference paper
    Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson.
    The Quantum Communication Complexity of Sampling.
    FOCS 1998 (0) 1998
    Conference paper
    Amnon Ta-Shma.
    Almost Optimal Dispersers.
    STOC 1998 (0) 1998
    Conference paper
    Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani.
    Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata
    CoRR 1998, Volume 0 (0) 1998
    Conference paper
    Jaikumar Radhakrishnan, Amnon Ta-Shma.
    Tight Bounds for Depth-two Superconcentrators.
    FOCS 1997 (0) 1997
    Conference paper
    Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou.
    SL = L
    STOC 1997 (0) 1997
    Conference paper
    Amnon Ta-Shma.
    On Extracting Randomness From Weak Random Sources (Extended Abstract).
    STOC 1996 (0) 1996
    Conference paper
    Amnon Ta-Shma.
    A Note on PCP vs. MIP.
    Inf. Process. Lett. 1996, Volume 58 (0) 1996
    Conference paper
    Noam Nisan, Amnon Ta-Shma.
    Symmetric logspace is closed under complement.
    Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA 1995 (0) 1995
    Conference paper
    Noam Nisan, Amnon Ta-Shma.
    Symmetric Logspace is Closed Under Complement.
    Chicago J. Theor. Comput. Sci. 1995, Volume 1995 (0) 1995
    Conference paper
    Amnon Ta-Shma.
    On Extracting Randomness From Weak Random Sources
    Electronic Colloquium on Computational Complexity (ECCC) 1995, Volume 2 (0) 1995
    Conference paper
    Noam Nisan, Amnon Ta-Shma.
    Symmetric Logspace is Closed Under Complement
    Electronic Colloquium on Computational Complexity (ECCC) 1994, Volume 1 (0) 1994
    Show item 1 to 93 of 93  

    Your query returned 93 matches in the database.