A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product

article by Avraham Ben-Aroya & Amnon Ta-Shma published January 2011 in SIAM Journal on Computing

A combinatorial construction of almost-ramanujan graphs using the zig-zag product

scholarly article published 2008

A note on PCP vs. MIP

Adiabatic Quantum State Generation

Adiabatic quantum state generation and statistical zero knowledge

Adiabatic quantum state generation and statistical zero knowledge

Almost optimal dispersers

scholarly article published 1998

An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy

Approximate Quantum Error Correction for Correlated Noise

Auditable, Anonymous Electronic Cash

Better Condensers and New Extractors from Parvaresh-Vardy Codes

Better lossless condensers through derandomized curve samplers

scholarly article published 2006

Blind, Auditable Membership Proofs

Classical versus quantum communication complexity

article by Amnon Ta-Shma published 1 September 1999 in ACM SIGACT News

Constructing Small-Bias Sets from Algebraic-Geometric Codes

scientific article (publication date: October 2009)

Dense quantum coding and quantum finite automata

Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

Explicit, almost optimal, epsilon-balanced codes

scholarly article published 2017

Extractor Codes

article published in 2004

Extractor codes

If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances

scholarly article

Improving the Alphabet-Size in Expander-Based Code Constructions

Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes

article by Eran Rom & Amnon Ta-Shma published 2005 in Lecture Notes in Computer Science

Interaction in Quantum Communication

scientific article published in June 2007

Interaction in quantum communication and the complexity of set disjointness

scholarly article published 2001

Inverting well conditioned matrices in quantum logspace

Local List Decoding with a Constant Number of Queries

Loss-less condensers, unbalanced expanders, and extractors

scholarly article published 2001

Non-interactive Timestamping in the Bounded Storage Model

article

Normal subgroup reconstruction and quantum computation using group representations

scholarly article published 2000

On extracting randomness from weak random sources (extended abstract)

On the Error Parameter of Dispersers

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace

Provable Unlinkability against Traffic Analysis

Quantum Expanders: Motivation and Constructions

Quantum bit escrow

SL ⊆L4/3

Short Seed Extractors against Quantum Storage

Short seed extractors against quantum storage

Storing information with extractors

Symmetric logspace is closed under complement

The Hidden Subgroup Problem and Quantum Computation Using Group Representations

scholarly article by Sean Hallgren et al published January 2003 in SIAM Journal on Computing

The Quantum Communication Complexity of Sampling

article by Andris Ambainis et al published January 2003 in SIAM Journal on Computing

Tight bounds for depth-two superconcentrators

Worst-Case to Average-Case Reductions Revisited