dblp.uni-trier.dewww.uni-trier.de

Amnon Ta-Shma Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
58EEAmnon Ta-Shma: Short seed extractors against quantum storage. STOC 2009: 401-408
57EETal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptology 22(2): 189-226 (2009)
2008
56EEAvraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma: Quantum Expanders: Motivation and Constructions. IEEE Conference on Computational Complexity 2008: 292-303
55EEAvraham Ben-Aroya, Amnon Ta-Shma: A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334
2007
54EEDan Gutfreund, Amnon Ta-Shma: Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583
53EEAmnon Ta-Shma, Uri Zwick: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA 2007: 599-608
52EEAmnon Ta-Shma, Christopher Umans, David Zuckerman: Lossless Condensers, Unbalanced Expanders, And Extractors. Combinatorica 27(2): 213-240 (2007)
51EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412-441 (2007)
50EEHartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication. IEEE Transactions on Information Theory 53(6): 1970-1982 (2007)
49EEDorit Aharonov, Amnon Ta-Shma: Adiabatic Quantum State Generation. SIAM J. Comput. 37(1): 47-82 (2007)
48EEIshay Haviv, Oded Regev, Amnon Ta-Shma: On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory of Computing 3(1): 45-60 (2007)
2006
47EEAmnon Ta-Shma, Christopher Umans: Better lossless condensers through derandomized curve samplers. FOCS 2006: 177-186
46EEDan Gutfreund, Amnon Ta-Shma: New connections between derandomization, worst-case complexity and average-case complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(108): (2006)
45EEEran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in Expander-Based Code Constructions. IEEE Transactions on Information Theory 52(8): 3695-3700 (2006)
44EEAmnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72(5): 786-812 (2006)
2005
43EERonen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305
42EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. IEEE Conference on Computational Complexity 2005: 243-257
41EEEran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. STACS 2005: 557-568
40EERonen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers Electronic Colloquium on Computational Complexity (ECCC)(061): (2005)
2004
39EETal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476
38EERon Berman, Amos Fiat, Amnon Ta-Shma: Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280
37EEEran Rom, Amnon Ta-Shma: Improveing the alphabet size in high noise, almost optimal rate list decodable codes Electronic Colloquium on Computational Complexity (ECCC)(069): (2004)
36EEAmnon Ta-Shma, David Zuckerman: Extractor codes. IEEE Transactions on Information Theory 50(12): 3015-3025 (2004)
2003
35EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47
34EEDorit Aharonov, Amnon Ta-Shma: Adiabatic quantum state generation and statistical zero knowledge. STOC 2003: 20-29
33EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)
32EESean Hallgren, Alexander Russell, Amnon Ta-Shma: The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM J. Comput. 32(4): 916-934 (2003)
31EEAndris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003)
2002
30EEAmnon Ta-Shma: Almost Optimal Dispersers. Combinatorica 22(1): 123-145 (2002)
29EEAmnon Ta-Shma: Storing information with extractors. Inf. Process. Lett. 83(5): 267-274 (2002)
28EEAndris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense quantum coding and quantum finite automata. J. ACM 49(4): 496-511 (2002)
2001
27 Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller Codes. FOCS 2001: 638-647
26EEHartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133
25EEAmnon Ta-Shma, Christopher Umans, David Zuckerman: Loss-less condensers, unbalanced expanders, and extractors. STOC 2001: 143-152
24EEAmnon Ta-Shma, David Zuckerman: Extractor codes. STOC 2001: 193-199
23EEAmnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller Codes Electronic Colloquium on Computational Complexity (ECCC) 8(36): (2001)
2000
22EETomas Sander, Amnon Ta-Shma, Moti Yung: Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71
21EESean Hallgren, Alexander Russell, Amnon Ta-Shma: Normal subgroup reconstruction and quantum computation using group representations. STOC 2000: 627-635
20EEDorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao: Quantum bit escrow. STOC 2000: 705-714
19EEAshwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication Complexity CoRR quant-ph/0005106: (2000)
18EERoy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou: An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2): 294-311 (2000)
17EEJaikumar Radhakrishnan, Amnon Ta-Shma: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discrete Math. 13(1): 2-24 (2000)
1999
16EETomas Sander, Amnon Ta-Shma: Auditable, Anonymous Electronic Cash Extended Abstract. CRYPTO 1999: 555-572
15EETomas Sander, Amnon Ta-Shma: Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. Financial Cryptography 1999: 46-61
14EETomas Sander, Amnon Ta-Shma: On Anonymous Electronic Cash and Crime. ISW 1999: 202-206
13EEAndris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC 1999: 376-383
12 Noam Nisan, Amnon Ta-Shma: Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999)
1998
11EEAndris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351
10EEAmnon Ta-Shma: Almost Optimal Dispersers. STOC 1998: 196-202
9EEAndris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata CoRR quant-ph/9804043: (1998)
1997
8EEJaikumar Radhakrishnan, Amnon Ta-Shma: Tight Bounds for Depth-two Superconcentrators. FOCS 1997: 585-594
7EERoy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou: SL <= L4/3. STOC 1997: 230-239
1996
6EEAmnon Ta-Shma: On Extracting Randomness From Weak Random Sources (Extended Abstract). STOC 1996: 276-285
5EEAmnon Ta-Shma: A Note on PCP vs. MIP. Inf. Process. Lett. 58(3): 135-140 (1996)
1995
4EENoam Nisan, Amnon Ta-Shma: Symmetric logspace is closed under complement. STOC 1995: 140-146
3EENoam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Chicago J. Theor. Comput. Sci. 1995: (1995)
2EEAmnon Ta-Shma: On Extracting Randomness From Weak Random Sources Electronic Colloquium on Computational Complexity (ECCC) 2(58): (1995)
1994
1EENoam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement Electronic Colloquium on Computational Complexity (ECCC) 1(3): (1994)

Coauthor Index

1Dorit Aharonov [20] [34] [49]
2Andris Ambainis [9] [11] [13] [28] [31]
3Roy Armoni [7] [18]
4Avraham Ben-Aroya [55] [56]
5Ron Berman [38]
6Amos Fiat [38]
7Ronen Gradwohl [40] [43]
8Dan Gutfreund (Danny Gutfreund) [33] [35] [42] [46] [51] [54]
9Sean Hallgren [21] [32]
10Ishay Haviv [48]
11Guy Kindler [40] [43]
12Hartmut Klauck [26] [50]
13Tal Moran [39] [57]
14Ashwin Nayak [9] [13] [19] [26] [28] [50]
15Noam Nisan [1] [3] [4] [12]
16Jaikumar Radhakrishnan [8] [17]
17Oded Regev [48]
18Omer Reingold [40] [43]
19Eran Rom [37] [41] [45]
20Alexander Russell [21] [32]
21Shmuel Safra [23] [27] [44]
22Tomas Sander [14] [15] [16] [22]
23Leonard J. Schulman [11] [31]
24Oded Schwartz [56]
25Ronen Shaltiel [33] [35] [39] [42] [51] [57]
26Christopher Umans [25] [47] [52]
27Umesh V. Vazirani [9] [11] [13] [20] [28] [31]
28Avi Wigderson [7] [11] [18] [31]
29Andrew Chi-Chih Yao [20]
30Moti Yung (Mordechai M. Yung) [22]
31Shiyu Zhou [7] [18]
32David Zuckerman [19] [23] [24] [25] [26] [27] [36] [44] [50] [52]
33Uri Zwick [53]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)