Amnon Ta-Shma

2009
57	EE	Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptology 22(2): 189-226 (2009)
2008
56	EE	Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma: Quantum Expanders: Motivation and Constructions. IEEE Conference on Computational Complexity 2008: 292-303
55	EE	Avraham Ben-Aroya, Amnon Ta-Shma: A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334
2007
54	EE	Dan Gutfreund, Amnon Ta-Shma: Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583
53	EE	Amnon Ta-Shma, Uri Zwick: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA 2007: 599-608
52	EE	Amnon Ta-Shma, Christopher Umans, David Zuckerman: Lossless Condensers, Unbalanced Expanders, And Extractors. Combinatorica 27(2): 213-240 (2007)
51	EE	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. Computational Complexity 16(4): 412-441 (2007)
50	EE	Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication. IEEE Transactions on Information Theory 53(6): 1970-1982 (2007)
49	EE	Dorit Aharonov, Amnon Ta-Shma: Adiabatic Quantum State Generation. SIAM J. Comput. 37(1): 47-82 (2007)
48	EE	Ishay 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
47	EE	Amnon Ta-Shma, Christopher Umans: Better lossless condensers through derandomized curve samplers. FOCS 2006: 177-186
46	EE	Dan Gutfreund, Amnon Ta-Shma: New connections between derandomization, worst-case complexity and average-case complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(108): (2006)
45	EE	Eran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in Expander-Based Code Constructions. IEEE Transactions on Information Theory 52(8): 3695-3700 (2006)
44	EE	Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72(5): 786-812 (2006)
2005
43	EE	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305
42	EE	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. IEEE Conference on Computational Complexity 2005: 243-257
41	EE	Eran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. STACS 2005: 557-568
40	EE	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers Electronic Colloquium on Computational Complexity (ECCC)(061): (2005)
2004
39	EE	Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476
38	EE	Ron Berman, Amos Fiat, Amnon Ta-Shma: Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280
37	EE	Eran 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)
36	EE	Amnon Ta-Shma, David Zuckerman: Extractor codes. IEEE Transactions on Information Theory 50(12): 3015-3025 (2004)
2003
35	EE	Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47
34	EE	Dorit Aharonov, Amnon Ta-Shma: Adiabatic quantum state generation and statistical zero knowledge. STOC 2003: 20-29
33	EE	Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)
32	EE	Sean Hallgren, Alexander Russell, Amnon Ta-Shma: The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM J. Comput. 32(4): 916-934 (2003)
31	EE	Andris 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
30	EE	Amnon Ta-Shma: Almost Optimal Dispersers. Combinatorica 22(1): 123-145 (2002)
29	EE	Amnon Ta-Shma: Storing information with extractors. Inf. Process. Lett. 83(5): 267-274 (2002)
28	EE	Andris 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
26	EE	Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133
25	EE	Amnon Ta-Shma, Christopher Umans, David Zuckerman: Loss-less condensers, unbalanced expanders, and extractors. STOC 2001: 143-152
24	EE	Amnon Ta-Shma, David Zuckerman: Extractor codes. STOC 2001: 193-199
23	EE	Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller Codes Electronic Colloquium on Computational Complexity (ECCC) 8(36): (2001)
2000
22	EE	Tomas Sander, Amnon Ta-Shma, Moti Yung: Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71
21	EE	Sean Hallgren, Alexander Russell, Amnon Ta-Shma: Normal subgroup reconstruction and quantum computation using group representations. STOC 2000: 627-635
20	EE	Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao: Quantum bit escrow. STOC 2000: 705-714
19	EE	Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication Complexity CoRR quant-ph/0005106: (2000)
18	EE	Roy 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)
17	EE	Jaikumar Radhakrishnan, Amnon Ta-Shma: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discrete Math. 13(1): 2-24 (2000)
1999
16	EE	Tomas Sander, Amnon Ta-Shma: Auditable, Anonymous Electronic Cash Extended Abstract. CRYPTO 1999: 555-572
15	EE	Tomas Sander, Amnon Ta-Shma: Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. Financial Cryptography 1999: 46-61
14	EE	Tomas Sander, Amnon Ta-Shma: On Anonymous Electronic Cash and Crime. ISW 1999: 202-206
13	EE	Andris 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
11	EE	Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351
10	EE	Amnon Ta-Shma: Almost Optimal Dispersers. STOC 1998: 196-202
9	EE	Andris 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
8	EE	Jaikumar Radhakrishnan, Amnon Ta-Shma: Tight Bounds for Depth-two Superconcentrators. FOCS 1997: 585-594
7	EE	Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou: SL <= L4/3. STOC 1997: 230-239
1996
6	EE	Amnon Ta-Shma: On Extracting Randomness From Weak Random Sources (Extended Abstract). STOC 1996: 276-285
5	EE	Amnon Ta-Shma: A Note on PCP vs. MIP. Inf. Process. Lett. 58(3): 135-140 (1996)
1995
4	EE	Noam Nisan, Amnon Ta-Shma: Symmetric logspace is closed under complement. STOC 1995: 140-146
3	EE	Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Chicago J. Theor. Comput. Sci. 1995: (1995)
2	EE	Amnon Ta-Shma: On Extracting Randomness From Weak Random Sources Electronic Colloquium on Computational Complexity (ECCC) 2(58): (1995)
1994
1	EE	Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement Electronic Colloquium on Computational Complexity (ECCC) 1(3): (1994)

Coauthor Index

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

Colors in the list of coauthors