Dan Gutfreund

Danny Gutfreund

	2011
24		Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan: On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475
23		Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity 20(2): 329-366 (2011)
	2010
22		Dan Gutfreund, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. IEEE Conference on Computational Complexity 2010: 38-49
21		Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan: On Approximating the Entropy of Polynomial Mappings. Electronic Colloquium on Computational Complexity (ECCC) 17: 160 (2010)
	2009
20		Dan Gutfreund, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 16: 146 (2009)
	2008
19		Dan Gutfreund, Guy N. Rothblum: The Complexity of Local List Decoding. APPROX-RANDOM 2008: 455-468
18		Dan Gutfreund, Salil P. Vadhan: Limitations of Hardness vs. Randomness under Uniform Reductions. APPROX-RANDOM 2008: 469-482
17		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (de)constructive approach to program checking. STOC 2008: 143-152
16		Dan Gutfreund, Salil P. Vadhan: Limitations of Hardness vs. Randomness under Uniform Reductions. Electronic Colloquium on Computational Complexity (ECCC) 15(007): (2008)
15		Dan Gutfreund, Guy N. Rothblum: The Complexity of Local List Decoding. Electronic Colloquium on Computational Complexity (ECCC) 15(034): (2008)
	2007
14		Dan Gutfreund, Amnon Ta-Shma: Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583
13		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: Verifying and decoding in constant depth. STOC 2007: 440-449
12		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)
11		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (De)constructive Approach to Program Checking. Electronic Colloquium on Computational Complexity (ECCC) 14(047): (2007)
	2006
10		Dan Gutfreund: Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. APPROX-RANDOM 2006: 386-397
9		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)
	2005
8		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
	2004
7		Dan Gutfreund, Emanuele Viola: Fooling Parity Tests with Parity Gates. APPROX-RANDOM 2004: 381-392
6		Emanuele Viola, Dan Gutfreund: Fooling Parity Tests with Parity Gates Electronic Colloquium on Computational Complexity (ECCC)(088): (2004)
5		Hana Chockler, Dan Gutfreund: A lower bound for testing juntas. Inf. Process. Lett. 90(6): 301-305 (2004)
	2003
4		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47
3		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)
2		Michael Ben-Or, Danny Gutfreund: Trading Help for Interaction in Statistical Zero-Knowledge Proofs. J. Cryptology 16(2): 95-116 (2003)
	2000
1		Danny Gutfreund, Michael Ben-Or: Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. ASIACRYPT 2000: 429-442

Coauthor Index

1	Baris Aydinlioglu	[23]
2	Michael Ben-Or	[1] [2]
3	Hana Chockler	[5]
4	Zeev Dvir	[21] [24]
5	Shafi Goldwasser	[11] [13] [17]
6	Alexander Healy	[11] [13] [17]
7	John M. Hitchcock	[23]
8	Tali Kaufman	[11] [13] [17]
9	Akinori Kawachi	[20] [22] [23]
10	Guy N. Rothblum	[11] [13] [15] [17] [19] [21] [24]
11	Ronen Shaltiel	[3] [4] [8] [12]
12	Amnon Ta-Shma	[3] [4] [8] [9] [12] [14]
13	Salil P. Vadhan	[16] [18] [21] [24]
14	Emanuele Viola	[6] [7]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page