Symmetric Logspace is Closed Under Complement. - Noam Nisan; Amnon Ta-Shma (Chic. J. Theor. Comput. Sci., 1995)

On Extracting Randomness From Weak Random Sources - Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 1995)

On Extracting Randomness From Weak Random Sources (Extended Abstract). - Amnon Ta-Shma (STOC, 1996)

A Note on PCP vs. MIP. - Amnon Ta-Shma (Inf. Process. Lett., 1996)

Refining randomness (כיצד לזקק אקראיות גסה.). - Amnon Ta-Shma (1996)

Tight Bounds for Depth-two Superconcentrators. - Jaikumar Radhakrishnan; Amnon Ta-Shma (FOCS, 1997)

SL <= L4/3. - Roy Armoni; Amnon Ta-Shma; Avi Wigderson; Shiyu Zhou (STOC, 1997)

Auditable, Anonymous Electronic Cash Extended Abstract. - Tomas Sander; Amnon Ta-Shma (CRYPTO, 1999)

Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. - Tomas Sander; Amnon Ta-Shma (Financial Cryptography, 1999)

On Anonymous Electronic Cash and Crime. - Tomas Sander; Amnon Ta-Shma (ISW, 1999)

Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. - Andris Ambainis; Ashwin Nayak 001; Amnon Ta-Shma; Umesh V. Vazirani (STOC, 1999)

Extracting Randomness: A Survey and New Constructions. - Noam Nisan; Amnon Ta-Shma (J. Comput. Syst. Sci., 1999)

Classical versus quantum communication complexity. - Amnon Ta-Shma (SIGACT News, 1999)

Blind, Auditable Membership Proofs. - Tomas Sander; Amnon Ta-Shma; Moti Yung (Financial Cryptography, 2000)

Quantum bit escrow. - Dorit Aharonov; Amnon Ta-Shma; Umesh V. Vazirani; Andrew Chi-Chih Yao (STOC, 2000)

Normal subgroup reconstruction and quantum computation using group representations. - Sean Hallgren; Alexander Russell; Amnon Ta-Shma (STOC, 2000)

Interaction in Quantum Communication Complexity - Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (CoRR, 2000)

An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. - Roy Armoni; Amnon Ta-Shma; Avi Wigderson; Shiyu Zhou (J. ACM, 2000)

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. - Jaikumar Radhakrishnan; Amnon Ta-Shma (SIAM J. Discret. Math., 2000)

Interaction in quantum communication and the complexity of set disjointness. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (STOC, 2001)

Loss-less condensers, unbalanced expanders, and extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (STOC, 2001)

Almost Optimal Dispersers. - Amnon Ta-Shma (Comb., 2002)

Storing information with extractors. - Amnon Ta-Shma (Inf. Process. Lett., 2002)

Dense quantum coding and quantum finite automata. - Andris Ambainis; Ashwin Nayak 001; Amnon Ta-Shma; Umesh V. Vazirani (J. ACM, 2002)

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (CCC, 2003)

Adiabatic quantum state generation and statistical zero knowledge. - Dorit Aharonov; Amnon Ta-Shma (STOC, 2003)

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (Comput. Complex., 2003)

The Quantum Communication Complexity of Sampling. - Andris Ambainis; Leonard J. Schulman; Amnon Ta-Shma; Umesh V. Vazirani; Avi Wigderson (SIAM J. Comput., 2003)

The Hidden Subgroup Problem and Quantum Computation Using Group Representations. - Sean Hallgren; Alexander Russell; Amnon Ta-Shma (SIAM J. Comput., 2003)

Provable Unlinkability against Traffic Analysis. - Ron Berman; Amos Fiat; Amnon Ta-Shma (Financial Cryptography, 2004)

Improveing the alphabet size in high noise, almost optimal rate list decodable codes - Eran Rom; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2004)

Extractor codes. - Amnon Ta-Shma; David Zuckerman (IEEE Trans. Inf. Theory, 2004)

Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. - Eran Rom; Amnon Ta-Shma (STACS, 2005)

On the Error Parameter of Dispersers - Ronen Gradwohl; Guy Kindler; Omer Reingold; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2005)

Better lossless condensers through derandomized curve samplers. - Amnon Ta-Shma; Christopher Umans (FOCS, 2006)

New connections between derandomization, worst-case complexity and average-case complexity. - Dan Gutfreund; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2006)

Extractors from Reed-Muller codes. - Amnon Ta-Shma; David Zuckerman; Shmuel Safra (J. Comput. Syst. Sci., 2006)

Improving the Alphabet-Size in Expander-Based Code Constructions. - Eran Rom; Amnon Ta-Shma (IEEE Trans. Inf. Theory, 2006)

Worst-Case to Average-Case Reductions Revisited. - Dan Gutfreund; Amnon Ta-Shma (APPROX-RANDOM, 2007)

Bare-Handed Electronic Voting with Pre-processing. - Ben Riva; Amnon Ta-Shma (EVT, 2007)

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (Comput. Complex., 2007)

Lossless Condensers, Unbalanced Expanders, And Extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (Comb., 2007)

On the Power of Quantum, One Round, Two Prover Interactive Proof Systems. - Alex Rapaport; Amnon Ta-Shma (Quantum Inf. Process., 2007)

Adiabatic Quantum State Generation. - Dorit Aharonov; Amnon Ta-Shma (SIAM J. Comput., 2007)

Interaction in Quantum Communication. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (IEEE Trans. Inf. Theory, 2007)

On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. - Ishay Haviv; Oded Regev 001; Amnon Ta-Shma (Theory Comput., 2007)

Quantum Expanders: Motivation and Constructions. - Avraham Ben-Aroya; Oded Schwartz; Amnon Ta-Shma (CCC, 2008)

Non-interactive Timestamping in the Bounded-Storage Model. - Tal Moran; Ronen Shaltiel; Amnon Ta-Shma (J. Cryptol., 2009)

Local list decoding with a constant number of queries. - Avraham Ben-Aroya; Klim Efremenko; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2010)

A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. - Avraham Ben-Aroya; Klim Efremenko; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2010)

On the complexity of approximating the diamond norm. - Avraham Ben-Aroya; Amnon Ta-Shma (Quantum Inf. Comput., 2010)

Quantum Expanders: Motivation and Construction. - Avraham Ben-Aroya; Oded Schwartz; Amnon Ta-Shma (Theory Comput., 2010)

A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. - Avraham Ben-Aroya; Amnon Ta-Shma (SIAM J. Comput., 2011)

Short Seed Extractors against Quantum Storage. - Amnon Ta-Shma (SIAM J. Comput., 2011)

Approximate Quantum Error Correction for Correlated Noise. - Avraham Ben-Aroya; Amnon Ta-Shma (IEEE Trans. Inf. Theory, 2011)

Better Condensers and New Extractors from Parvaresh-Vardy Codes. - Amnon Ta-Shma; Christopher Umans (CCC, 2012)

A New Implementation of a Dual (Paper and Cryptographic) Voting System. - Jonathan Ben-Nun; Niko Fahri; Morgan Llewellyn; Ben Riva; Alon Rosen; Amnon Ta-Shma; Douglas Wikström (Electronic Voting, 2012)

Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints - Rotem Arnon Friedman; Esther Hänggi; Amnon Ta-Shma (CoRR, 2012)

On the limits of privacy amplification against non-signalling memory attacks - Rotem Arnon Friedman; Amnon Ta-Shma (CoRR, 2012)

Better short-seed quantum-proof extractors. - Avraham Ben-Aroya; Amnon Ta-Shma (Theor. Comput. Sci., 2012)

Inverting well conditioned matrices in quantum logspace. - Amnon Ta-Shma (STOC, 2013)

Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes. - Gil Cohen; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2013)

Constructing Small-Bias Sets from Algebraic-Geometric Codes. - Avraham Ben-Aroya; Amnon Ta-Shma (Theory Comput., 2013)

Orthography and Biblical Criticism. - Idan Dershowitz; Nachum Dershowitz; Tomer Hasid; Amnon Ta-Shma (DH, 2014)

The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent. - Efraim Gelman; Amnon Ta-Shma (FSTTCS, 2014)

Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. - Amnon Ta-Shma; Uri Zwick (ACM Trans. Algorithms, 2014)

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. - Dean Doron; Amnon Ta-Shma (ICALP (1), 2015)

On the de-randomization of space-bounded approximate counting problems. - Dean Doron; Amnon Ta-Shma (Inf. Process. Lett., 2015)

Provable Unlinkability Against Traffic Analysis with Low Message Overhead. - Ron Berman; Amos Fiat; Marcin Gomulkiewicz; Marek Klonowski; Miroslaw Kutylowski; Tomer Levinboim; Amnon Ta-Shma (J. Cryptol., 2015)

Explicit two-source extractors for near-logarithmic min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2016)

Low-error two-source extractors for polynomial min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2016)

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (STOC, 2017)

On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. - Dean Doron; Amir Sarid; Amnon Ta-Shma (Comput. Complex., 2017)

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 006; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

Probabilistic logarithmic-space algorithms for Laplacian solvers. - Dean Doron; Francois Le Gall; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

Explicit, almost optimal, epsilon-balanced codes. - Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2017)

A New Approach for Constructing Low-Error, Two-Source Extractors. - Avraham Ben-Aroya; Eshan Chattopadhyay; Dean Doron; Xin Li 006; Amnon Ta-Shma (CCC, 2018)

Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. - Avraham Ben-Aroya; Gil Cohen; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2018)

Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2018)

On the Entropy Loss and Gap of Condensers. - Nir Aviv; Amnon Ta-Shma (ACM Trans. Comput. Theory, 2019)

Near-Optimal Erasure List-Decodable Codes. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (CCC, 2020)

Expander Random Walks: A Fourier-Analytic Approach. - Gil Cohen; Noam Peri; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2020)

Pr-ZSUBEXP is not contained in Pr-RP. - Gonen Krak; Noam Parzanchevski; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2020)

Error Reduction For Weighted PRGs Against Read Once Branching Programs. - Gil Cohen; Dean Doron; Oren Renard; Ori Sberlo; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2021)

Expander Random Walks: The General Case and Limitations. - Gil Cohen; Dor Minzer; Shir Peleg; Aaron Potechin; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2021)

List-Decoding with Double Samplers. - Irit Dinur; Prahladh Harsha; Tali Kaufman; Inbal Livni Navon; Amnon Ta-Shma (SIAM J. Comput., 2021)

On Hitting-Set Generators for Polynomials that Vanish Rarely. - Dean Doron; Amnon Ta-Shma; Roei Tell (Comput. Complex., 2022)

Approximating Iterated Multiplication of Stochastic Matrices in Small Space. - Gil Cohen; Dean Doron; Ori Sberlo; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2022)

Unbalanced Expanders from Multiplicity Codes. - Itay Kalev; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2022)

The plane test is a local tester for Multiplicity Codes. - Dan Karliner; Roie Salama; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2022)

Improved local testing for multiplicity codes. - Dan Karliner; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2022)

An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy. - Avraham Ben-Aroya; Dean Doron; Amnon Ta-Shma (SIAM J. Comput., 2022)

HDX Condensers. - Itay Cohen 003; Roy Roth; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2023)

The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced. - Amnon Ta-Shma; Ron Zadicario (APPROX/RANDOM, 2024)

Character sums over AG codes. - Swastik Kopparty; Amnon Ta-Shma; Kedem Yakirevitch (Electron. Colloquium Comput. Complex., 2024)

The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced. - Amnon Ta-Shma; Ron Zadiario (Electron. Colloquium Comput. Complex., 2024)

Simplifying Armoni's PRG. - Ben Chen; Amnon Ta-Shma (APPROX/RANDOM, 2025)

Simplyfing Armoni's PRG. - Amnon Ta-Shma; Ben Chen (Electron. Colloquium Comput. Complex., 2025)

Better Weighted Pseudorandom Generators Against Low Weight Read-Once Branching Programs. - Amnon Ta-Shma; Ben Chen (Electron. Colloquium Comput. Complex., 2025)