Search the dblp DataBase
Amnon Ta-Shma :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Ronen Gradwohl , Guy Kindler , Omer Reingold , Amnon Ta-Shma On the Error Parameter of Dispersers. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2005, pp:294-305 [Conf ] Dan Gutfreund , Ronen Shaltiel , Amnon Ta-Shma Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2003, pp:33-47 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2005, pp:243-257 [Conf ] Tal Moran , Ronen Shaltiel , Amnon Ta-Shma Non-interactive Timestamping in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2004, pp:460-476 [Conf ] Tomas Sander , Amnon Ta-Shma Auditable, Anonymous Electronic Cash Extended Abstract. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1999, pp:555-572 [Conf ] Ron Berman , Amos Fiat , Amnon Ta-Shma Provable Unlinkability against Traffic Analysis. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 2004, pp:266-280 [Conf ] Tomas Sander , Amnon Ta-Shma Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 1999, pp:46-61 [Conf ] Tomas Sander , Amnon Ta-Shma , Moti Yung Blind, Auditable Membership Proofs. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 2000, pp:53-71 [Conf ] Andris Ambainis , Leonard J. Schulman , Amnon Ta-Shma , Umesh V. Vazirani , Avi Wigderson The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:342-351 [Conf ] Jaikumar Radhakrishnan , Amnon Ta-Shma Tight Bounds for Depth-two Superconcentrators. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:585-594 [Conf ] Amnon Ta-Shma , David Zuckerman , Shmuel Safra Extractors from Reed-Muller Codes. [Citation Graph (0, 0)][DBLP ] FOCS, 2001, pp:638-647 [Conf ] Amnon Ta-Shma , Christopher Umans Better lossless condensers through derandomized curve samplers. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:177-186 [Conf ] Tomas Sander , Amnon Ta-Shma On Anonymous Electronic Cash and Crime. [Citation Graph (0, 0)][DBLP ] ISW, 1999, pp:202-206 [Conf ] Eran Rom , Amnon Ta-Shma Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:557-568 [Conf ] Dorit Aharonov , Amnon Ta-Shma Adiabatic quantum state generation and statistical zero knowledge. [Citation Graph (0, 0)][DBLP ] STOC, 2003, pp:20-29 [Conf ] Dorit Aharonov , Amnon Ta-Shma , Umesh V. Vazirani , Andrew Chi-Chih Yao Quantum bit escrow. [Citation Graph (0, 0)][DBLP ] STOC, 2000, pp:705-714 [Conf ] Andris Ambainis , Ashwin Nayak , Amnon Ta-Shma , Umesh V. Vazirani Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:376-383 [Conf ] Roy Armoni , Amnon Ta-Shma , Avi Wigderson , Shiyu Zhou SL <= L4/3 . [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:230-239 [Conf ] Sean Hallgren , Alexander Russell , Amnon Ta-Shma Normal subgroup reconstruction and quantum computation using group representations. [Citation Graph (0, 0)][DBLP ] STOC, 2000, pp:627-635 [Conf ] Hartmut Klauck , Ashwin Nayak , Amnon Ta-Shma , David Zuckerman Interaction in quantum communication and the complexity of set disjointness. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:124-133 [Conf ] Noam Nisan , Amnon Ta-Shma Symmetric logspace is closed under complement. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:140-146 [Conf ] Amnon Ta-Shma On Extracting Randomness From Weak Random Sources (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:276-285 [Conf ] Amnon Ta-Shma Almost Optimal Dispersers. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:196-202 [Conf ] Amnon Ta-Shma , Christopher Umans , David Zuckerman Loss-less condensers, unbalanced expanders, and extractors. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:143-152 [Conf ] Amnon Ta-Shma , David Zuckerman Extractor codes. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:193-199 [Conf ] Dan Gutfreund , Ronen Shaltiel , Amnon Ta-Shma Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 2003, v:12, n:3-4, pp:85-130 [Journal ] Noam Nisan , Amnon Ta-Shma Symmetric Logspace is Closed Under Complement. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal ] Amnon Ta-Shma Almost Optimal Dispersers. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2002, v:22, n:1, pp:123-145 [Journal ] Ashwin Nayak , Amnon Ta-Shma , David Zuckerman Interaction in Quantum Communication Complexity [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Andris Ambainis , Ashwin Nayak , Amnon Ta-Shma , Umesh V. Vazirani Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata [Citation Graph (0, 0)][DBLP ] CoRR, 1998, v:0, n:, pp:- [Journal ] Amnon Ta-Shma , David Zuckerman , Shmuel Safra Extractors from Reed-Muller Codes [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:36, pp:- [Journal ] Eran Rom , Amnon Ta-Shma Improveing the alphabet size in high noise, almost optimal rate list decodable codes [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:069, pp:- [Journal ] Ronen Gradwohl , Guy Kindler , Omer Reingold , Amnon Ta-Shma On the Error Parameter of Dispersers [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:061, pp:- [Journal ] Amnon Ta-Shma On Extracting Randomness From Weak Random Sources [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:58, pp:- [Journal ] Amnon Ta-Shma Storing information with extractors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:83, n:5, pp:267-274 [Journal ] Amnon Ta-Shma A Note on PCP vs. MIP. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:58, n:3, pp:135-140 [Journal ] Roy Armoni , Amnon Ta-Shma , Avi Wigderson , Shiyu Zhou An O (log(n )4/3 ) space algorithm for (s, t ) connectivity in undirected graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 2000, v:47, n:2, pp:294-311 [Journal ] Andris Ambainis , Ashwin Nayak , Amnon Ta-Shma , Umesh V. Vazirani Dense quantum coding and quantum finite automata. [Citation Graph (0, 0)][DBLP ] J. ACM, 2002, v:49, n:4, pp:496-511 [Journal ] Noam Nisan , Amnon Ta-Shma Extracting Randomness: A Survey and New Constructions. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:1, pp:148-173 [Journal ] Amnon Ta-Shma , David Zuckerman , Shmuel Safra Extractors from Reed-Muller codes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:5, pp:786-812 [Journal ] Andris Ambainis , Leonard J. Schulman , Amnon Ta-Shma , Umesh V. Vazirani , Avi Wigderson The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:6, pp:1570-1585 [Journal ] Sean Hallgren , Alexander Russell , Amnon Ta-Shma The Hidden Subgroup Problem and Quantum Computation Using Group Representations. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:4, pp:916-934 [Journal ] Dorit Aharonov , Amnon Ta-Shma Adiabatic Quantum State Generation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:37, n:1, pp:47-82 [Journal ] Jaikumar Radhakrishnan , Amnon Ta-Shma Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2000, v:13, n:1, pp:2-24 [Journal ] Amnon Ta-Shma , David Zuckerman Extractor codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3015-3025 [Journal ] Eran Rom , Amnon Ta-Shma Improving the Alphabet-Size in Expander-Based Code Constructions. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3695-3700 [Journal ] Hartmut Klauck , Ashwin Nayak , Amnon Ta-Shma , David Zuckerman Interaction in Quantum Communication. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:1970-1982 [Journal ] Dan Gutfreund , Amnon Ta-Shma Worst-Case to Average-Case Reductions Revisited. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2007, pp:569-583 [Conf ] Amnon Ta-Shma , Uri Zwick Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:599-608 [Conf ] Amnon Ta-Shma , Christopher Umans , David Zuckerman Lossless Condensers, Unbalanced Expanders, And Extractors. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2007, v:27, n:2, pp:213-240 [Journal ] Quantum Expanders: Motivation and Constructions. [Citation Graph (, )][DBLP ] Constructing Small-Bias Sets from Algebraic-Geometric Codes. [Citation Graph (, )][DBLP ] A combinatorial construction of almost-ramanujan graphs using the zig-zag product. [Citation Graph (, )][DBLP ] Short seed extractors against quantum storage. [Citation Graph (, )][DBLP ] If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. [Citation Graph (, )][DBLP ] New connections between derandomization, worst-case complexity and average-case complexity. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.308secs