- On the complexity of approximating the diamond norm Avraham Ben-Aroya
- Adiabatic Quantum State Generation and Statistical Zero Dorit Aharonov # Amnon TaShma +
- Tel Aviv University Raymond and Beverly Sackler
- Quantum Expanders: Motivation and Constructions Avraham Ben-Aroya
- IMPROVING THE ALPHABET-SIZE IN EXPANDER BASED CODE CONSTRUCTIONS
- Uniform hardness vs. randomness tradeo#s for ArthurMerlin games Dan Gutfreund
- Journal of Computer and System Sciences 72 (2006) 786812 www.elsevier.com/locate/jcss
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 4782
- Tel-Aviv University Raymond and Beverly Sackler
- Information Processing Letters 83 (2002) 267274 www.elsevier.com/locate/ipl
- Chicago Journal of Theoretical Computer Science
- Extractors from ReedMuller Codes Amnon TaShma
- Constructing Small-Bias Sets from Algebraic-Geometric Avraham Ben-Aroya
- Worst-Case to Average-Case Reductions Dan Gutfreund1
- THE QUANTUM COMMUNICATION COMPLEXITY OF ANDRIS AMBAINIS, LEONARD J. SCHULMAN, AMNON TA-SHMA,
- Pseudorandomness for Network Algorithms Russell Impagliazzo \Lambda Noam Nisan y Avi Wigderson z
- Improving the alphabet-size in high noise, almost optimal rate list decodable codes
- Bare-Handed Electronic Voting with Pre-processing , Amnon Ta-Shma2
- PASSIVE TIMESTAMPING IN THE BOUNDED STORAGE MODEL SUBMISSION VERSION
- Provable Anonymity Against Tra#c Analysis # Ron Berman, Amos Fiat, Amnon TaShma
- Provable Unlinkability Against Tra#c Analysis Ron Berman # Amos Fiat + Amnon TaShma #
- The Quantum Communication Complexity of Sampling Andris Ambainis
- COMBINATORICA Bolyai Society { Springer-Verlag
- Better lossless condensers through derandomized curve samplers
- Symmetric Logspace is Closed Under Complement * Noam Nisant Amnon Ta-Shma$
- An O(log(n) 4=3 ) Space Algorithm for (s; t)
- Extracting Randomness: How and Why Noam Nisan \Lambda
- Tel Aviv University Raymond and Beverly Sackler
- SIGACT News Complexity Theory Column 23 Lane A. Hemaspaandra
- Noam Nisan \Lambda March 1, 1995
- Concurrency Counts Orna Kupferman
- Roy Armoni \Lambda Amnon TaShma y Avi Wigderson z Shiyu Zhou x We present a deterministic algorithm that computes
- On the Composition of ZeroKnowledge Proof Systems Oded Goldreich Hugo Krawczyk *
- Loss-less Condensers, Unbalanced Expanders, and Amnon Ta-Shma Christopher Umans David Zuckerman
- SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics Vol. 40, No. 2, pp. 267290
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- Tight bounds for depthtwo superconcentrators Jaikumar Radhakrishnan Amnon TaShma
- THEORY OF COMPUTING www.theoryofcomputing.org
- Information Information Processing Letters 58 ( 1996) 135-140
- Better short-seed extractors against quantum knowledge Avraham Ben-Aroya
- A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
- Short seed extractors against quantum storage Amnon Ta-Shma
- Short Seed Extractors Against Quantum Storage Amnon Ta-Shma
- SHORT SEED EXTRACTORS AGAINST QUANTUM STORAGE AMNON TA-SHMA
- arXiv:0709.0911v1[quant-ph]6Sep2007 An Explicit Construction of Quantum Expanders
- On the power of quantum, one round, two prover interactive proof systems
- New connections between derandomization, worst-case complexity and average-case complexity
- IF NP LANGUAGES ARE HARD ON THE WORST-CASE, THEN IT IS EASY TO
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 8, AUGUST 2006 3695 can be broken down to four mappings of n = 4to M = 16which only
- comput. complex. 12 (2003), 85 130 1016-3328/03/03008546
- Adiabatic Quantum State Generation and Statistical Zero Knowledge
- Extractor Codes Amnon Ta-Shma
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 12, DECEMBER 2004 3015 Extractor Codes
- Interaction in Quantum Communication and the Complexity of Set Disjointness
- Normal Subgroup Reconstructionand Quantum Computation Using Group Representations
- THE HIDDEN SUBGROUP PROBLEM AND QUANTUM COMPUTATION USING GROUP REPRESENTATIONS
- Auditable, Anonymous Electronic Cash (Extended Abstract)
- Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems
- Almost Optimal Dispersers Amnon Ta-Shma *
- COMBINATORICA Bolyai Society Springer-Verlag
- Journal of Computer and System Sciences 58, 148 173 (1999) Extracting Randomness: A Survey and New Constructions*
- On Extracting Randomness From Weak Random Sources * Extended Abstract
- .) " " M. Sc( )randomness extractors(
- Bipartite subgraphs and the smallest eigenvalue Benny Sudakov
- S-T Connectivity on Digraphs with a Known Stationary Distribution
- Quantum Bit Escrow Dorit Aharonov *
- arXiv:0707.1136v1[quant-ph]8Jul2007 On the power of quantum, one round, two prover
- Refining Randomness Thesis submitted for the degree
- Simple Constructions of Almost kwise Independent Random Variables
- On the Hardness of Satisfiability with Bounded Occurrences in the PolynomialTime Hierarchy
- BOUNDS FOR DISPERSERS, EXTRACTORS, AND DEPTH-TWO SUPERCONCENTRATORS
- Local List-Decoding with a Constant Number of Queries Avraham Ben-Aroya
- THEORY OF COMPUTING, Volume 6 (2010), pp. 4779 www.theoryofcomputing.org
- Randomness is Linear in Space \Lambda Noam Nisan y David Zuckerman z
- 1970 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 6, JUNE 2007 Interaction in Quantum Communication
- Pseudorandom Walks on Regular Digraphs and the RL vs. L Problem #
- Constructing Small-Bias Sets from Algebraic-Geometric Avraham Ben-Aroya
- Approximate quantum error correction for correlated noise Avraham Ben-Aroya
- Blind, Auditable Membership Proofs Tomas Sander1 ?, Amnon Ta-Shma2, and Moti Yung3
- Approximate quantum error correction for correlated noise Avraham Ben-Aroya
- A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
- Bare-Handed Electronic Voting with Pre-processing , Amnon Ta-Shma2
- Tel Aviv University The Raymond and Beverly Sackler
- Tel Aviv University Raymond and Beverly Sackler
- If NP languages are hard on the worstcase then it is easy to find their hard instances
- On Anonymous Electronic Cash and Crime Tomas Sander and Amnon TaShma
- Better condensers and new extractors from Parvaresh-Vardy codes Amnon Ta-Shma
- Non-Interactive Timestamping in the Bounded Storage Model Ronen Shaltiel
- arXiv:1004.3737v4[quant-ph]23Jun2011 Better short-seed quantum-proof extractors
- TEL AVIV UNIVERSITY THE RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES
- Better condensers and new extractors from Parvaresh-Vardy codes Amnon Ta-Shma
