The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen A. Fenner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen A. Fenner, William I. Gasarch
    The Complexity of Learning SUBSEQ (A). [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:109-123 [Conf]
  2. Stephen A. Fenner
    Notions of Resource-Bounded Category and Genericity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:196-212 [Conf]
  3. Stephen A. Fenner
    Inverting the Turing Jump in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:102-110 [Conf]
  4. Stephen A. Fenner
    Resource-Bounded Baire Category: A Stronger Approach. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:182-192 [Conf]
  5. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    Gap-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:30-42 [Conf]
  6. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
    An Oarcle Builder's Toolkit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:120-131 [Conf]
  7. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
    Inverting Onto Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:213-222 [Conf]
  8. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf]
  9. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-Polynomial Hierarchies and the NP-Jump. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:102-110 [Conf]
  10. Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
    Bounds on the Power of Constant-Depth Quantum Circuits. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:44-55 [Conf]
  11. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    The Isomorphism Conjecture Holds Relative to an Oracle [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:30-39 [Conf]
  12. Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
    Every Polynomial-Time 1-Degree Collapses iff P=PSPACE [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:624-629 [Conf]
  13. Harry Buhrman, Stephen A. Fenner, Lance Fortnow
    Results on Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:188-194 [Conf]
  14. Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
    Weakly Useful Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:393-404 [Conf]
  15. Stephen A. Fenner, Yong Zhang
    Quantum Algorithms for a Set of Group Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:215-227 [Conf]
  16. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
    Optimal Proof Systems and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:407-418 [Conf]
  17. Stephen A. Fenner, Lance Fortnow
    Beyond P^(NP) - NEXP. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:619-627 [Conf]
  18. Stephen A. Fenner, Lance Fortnow, Lide Li
    Gap-Definability as a Closure Property. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:484-493 [Conf]
  19. Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
    On Using Oracles That Compute Values. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:398-407 [Conf]
  20. Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet
    Two oracles that force a big crunch. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:93-116 [Journal]
  21. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  22. Stephen A. Fenner
    Gales and supergales are equivalent for defining constructive Hausdorff dimension [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  23. Stephen A. Fenner
    A Physics-Free Introduction to the Quantum Computation Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  24. Stephen A. Fenner
    A physics-free introduction to the quantum computation model, Computational Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:79, n:, pp:69-85 [Journal]
  25. Stephen A. Fenner
    PP-lowness and a simple definition of AWPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:036, pp:- [Journal]
  26. Marcus Schaefer, Stephen A. Fenner
    Simplicity and Strong Reductions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:071, pp:- [Journal]
  27. Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim
    Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:3, pp:- [Journal]
  28. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
    An oracle builder's toolkit. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:2, pp:95-136 [Journal]
  29. Stephen A. Fenner, Lance Fortnow, Lide Li
    Gap-Definability as a Closure Property. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:1, pp:1-17 [Journal]
  30. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
    Inverting onto functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:90-103 [Journal]
  31. Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon
    Weakly useful sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:197, n:1-2, pp:41-54 [Journal]
  32. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    Gap-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:1, pp:116-148 [Journal]
  33. Stephen A. Fenner
    Almost Weakly 2-Generic Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:3, pp:868-887 [Journal]
  34. Stephen A. Fenner, Marcus Schaefer
    Bounded Immunity and Btt-Reductions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1999, v:45, n:, pp:3-21 [Journal]
  35. Stephen A. Fenner
    PP-Lowness and a Simple Definition of AWPP. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:2, pp:199-212 [Journal]
  36. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    The Isomorphism Conjecture Holds Relative to an Oracle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:193-206 [Journal]
  37. Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
    Oracles that Compute Values. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1043-1065 [Journal]
  38. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-polynomial hierarchies and the polynomial jump. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:241-256 [Journal]
  39. Stephen A. Fenner, Yong Zhang
    The central nature of the Hidden Subgroup problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  40. Efficient Universal Quantum Circuits. [Citation Graph (, )][DBLP]


  41. On the Complexity of the Hidden Subgroup Problem. [Citation Graph (, )][DBLP]


  42. Universal Quantum Circuits [Citation Graph (, )][DBLP]


  43. Universal Quantum Circuits. [Citation Graph (, )][DBLP]


  44. The complexity of learning SUBSEQ(A). [Citation Graph (, )][DBLP]


Search in 0.650secs, Finished in 0.651secs
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