| 2023 | FOCS | HDX Condensers. | Itay Cohen, Roy Roth, Amnon Ta-Shma |
| 2023 | STOC | Approximating Iterated Multiplication of Stochastic Matrices in Small Space. | Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma |
| 2022 | ICALP | Expander Random Walks: The General Case and Limitations. | Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma |
| 2021 | STOC | Expander random walks: a Fourier-analytic approach. | Gil Cohen, Noam Peri, Amnon Ta-Shma |
| 2019 | SODA | List Decoding with Double Samplers. | Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma |
| 2017 | STOC | An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
| 2017 | STOC | Explicit, almost optimal, epsilon-balanced codes. | Amnon Ta-Shma |
| 2015 | ICALP | On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. | Dean Doron, Amnon Ta-Shma |
| 2013 | STOC | Inverting well conditioned matrices in quantum logspace. | Amnon Ta-Shma |
| 2010 | FOCS | Local List Decoding with a Constant Number of Queries. | Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma |
| 2009 | FOCS | Constructing Small-Bias Sets from Algebraic-Geometric Codes. | Avraham Ben-Aroya, Amnon Ta-Shma |
| 2009 | STOC | Short seed extractors against quantum storage. | Amnon Ta-Shma |
| 2008 | STOC | A combinatorial construction of almost-ramanujan graphs using the zig-zag product. | Avraham Ben-Aroya, Amnon Ta-Shma |
| 2007 | SODA | Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. | Amnon Ta-Shma, Uri Zwick |
| 2006 | FOCS | Better lossless condensers through derandomized curve samplers. | Amnon Ta-Shma, Christopher Umans |
| 2005 | STACS | Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. | Eran Rom, Amnon Ta-Shma |
| 2004 | CRYPTO | Non-interactive Timestamping in the Bounded Storage Model. | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
| 2004 | FC | Provable Unlinkability against Traffic Analysis. | Ron Berman, Amos Fiat, Amnon Ta-Shma |
| 2003 | STOC | Adiabatic quantum state generation and statistical zero knowledge. | Dorit Aharonov, Amnon Ta-Shma |
| 2001 | FOCS | Extractors from Reed-Muller Codes. | Amnon Ta-Shma, David Zuckerman, Shmuel Safra |
| 2001 | STOC | Interaction in quantum communication and the complexity of set disjointness. | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
| 2001 | STOC | Loss-less condensers, unbalanced expanders, and extractors. | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
| 2001 | STOC | Extractor codes. | Amnon Ta-Shma, David Zuckerman |
| 2000 | FC | Blind, Auditable Membership Proofs. | Tomas Sander, Amnon Ta-Shma, Moti Yung |
| 2000 | STOC | Quantum bit escrow. | Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao |
| 2000 | STOC | Normal subgroup reconstruction and quantum computation using group representations. | Sean Hallgren, Alexander Russell, Amnon Ta-Shma |
| 1999 | CRYPTO | Auditable, Anonymous Electronic Cash Extended Abstract. | Tomas Sander, Amnon Ta-Shma |
| 1999 | FC | Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. | Tomas Sander, Amnon Ta-Shma |
| 1999 | STOC | Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
| 1998 | FOCS | The Quantum Communication Complexity of Sampling. | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
| 1998 | STOC | Almost Optimal Dispersers. | Amnon Ta-Shma |
| 1997 | FOCS | Tight Bounds for Depth-two Superconcentrators. | Jaikumar Radhakrishnan, Amnon Ta-Shma |
| 1997 | STOC | SL <= L | Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou |
| 1996 | STOC | On Extracting Randomness From Weak Random Sources (Extended Abstract). | Amnon Ta-Shma |
| 1995 | STOC | Symmetric logspace is closed under complement. | Noam Nisan, Amnon Ta-Shma |