The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dan Gutfreund: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dan Gutfreund, Emanuele Viola
    Fooling Parity Tests with Parity Gates. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:381-392 [Conf]
  2. Dan Gutfreund
    Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:386-397 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. Emanuele Viola, Dan Gutfreund
    Fooling Parity Tests with Parity Gates [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:088, pp:- [Journal]
  7. Hana Chockler, Dan Gutfreund
    A lower bound for testing juntas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:6, pp:301-305 [Journal]
  8. Dan Gutfreund, Amnon Ta-Shma
    Worst-Case to Average-Case Reductions Revisited. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:569-583 [Conf]
  9. Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
    Verifying and decoding in constant depth. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:440-449 [Conf]

  10. The Complexity of Local List Decoding. [Citation Graph (, )][DBLP]


  11. Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP]


  12. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. [Citation Graph (, )][DBLP]


  13. A (de)constructive approach to program checking. [Citation Graph (, )][DBLP]


  14. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. [Citation Graph (, )][DBLP]


  15. Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP]


  16. The Complexity of Local List Decoding. [Citation Graph (, )][DBLP]


  17. A (De)constructive Approach to Program Checking. [Citation Graph (, )][DBLP]


  18. New connections between derandomization, worst-case complexity and average-case complexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002