Stephen A. Fenner Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf: On Two-Level Poset Games. Electronic Colloquium on Computational Complexity (ECCC) 20: 19 (2013)
2012
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Functions that preserve p-randomness. CoRR abs/1202.6395 (2012)
2011
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Functions That Preserve p-Randomness. FCT 2011: 336-347
2010
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient universal quantum circuits. Quantum Information & Computation 10(1&2): 16-27 (2010)
2009
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). J. Symb. Log. 74(3): 939-975 (2009)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, William I. Gasarch, Brian Postow: The Complexity of Finding SUBSEQ(A). Theory Comput. Syst. 45(3): 577-612 (2009)
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient Universal Quantum Circuits. COCOON 2009: 418-428
2008
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Yong Zhang: On the Complexity of the Hidden Subgroup Problem. TAMC 2008: 70-81
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits. CoRR abs/0804.2429 (2008)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). Electronic Colloquium on Computational Complexity (ECCC) 15(053) (2008)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits. Electronic Colloquium on Computational Complexity (ECCC) 15(078) (2008)
2006
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Quantum lower bounds for fanout. Quantum Information & Computation 6(1): 46-57 (2006)
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, William I. Gasarch: The Complexity of Learning SUBSEQ (A). ALT 2006: 109-123
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Yong Zhang: The central nature of the Hidden Subgroup problem. CoRR abs/cs/0610086 (2006)
2005
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon: Weakly useful sequences. Inf. Comput. 197(1-2): 41-54 (2005)
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Yong Zhang: Quantum Algorithms for a Set of Group Theoretic Problems. ICTCS 2005: 215-227
2004
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Stuart A. Kurtz, James S. Royer: Every polynomial-time 1-degree collapses if and only if P = PSPACE. J. Symb. Log. 69(3): 713-741 (2004)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marcus Schaefer, Stephen A. Fenner: Simplicity and Strong Reductions. Electronic Colloquium on Computational Complexity (ECCC)(071) (2004)
2003
j14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: A physics-free introduction to the quantum computation model, Computational Complexity Column. Bulletin of the EATCS 79: 69-85 (2003)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li: An oracle builder's toolkit. Inf. Comput. 182(2): 95-136 (2003)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: PP-Lowness and a Simple Definition of AWPP. Theory Comput. Syst. 36(2): 199-212 (2003)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: A Physics-Free Introduction to the Quantum Computation Model. CoRR cs.CC/0304008 (2003)
2002
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Gales and supergales are equivalent for defining constructive Hausdorff dimension. CoRR cs.CC/0208044 (2002)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: PP-lowness and a simple definition of AWPP. Electronic Colloquium on Computational Complexity (ECCC)(036) (2002)
2001
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet: Two oracles that force a big crunch. Computational Complexity 10(2): 93-116 (2001)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer: Hyper-polynomial hierarchies and the polynomial jump. Theor. Comput. Sci. 262(1): 241-256 (2001)
2000
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek: Optimal Proof Systems and Sparse Sets. STACS 2000: 407-418
1999
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. Chicago J. Theor. Comput. Sci. 1999 (1999)
j7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Marcus Schaefer: Bounded Immunity and Btt-Reductions. Math. Log. Q. 45: 3-21 (1999)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim: Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 6(3) (1999)
1997
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman: Oracles that Compute Values. SIAM J. Comput. 26(4): 1043-1065 (1997)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer: Hyper-Polynomial Hierarchies and the NP-Jump. IEEE Conference on Computational Complexity 1997: 102-110
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Stephen A. Fenner, Lance Fortnow: Results on Resource-Bounded Measure. ICALP 1997: 188-194
1996
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Lide Li: Gap-Definability as a Closure Property. Inf. Comput. 130(1): 1-17 (1996)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: The Isomorphism Conjecture Holds Relative to an Oracle. SIAM J. Comput. 25(1): 193-206 (1996)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, William I. Gasarch: Complexity Theory Newsflash. SIGACT News 27(3): 126 (1996)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting Onto Functions. IEEE Conference on Computational Complexity 1996: 213-222
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. IEEE Conference on Computational Complexity 1996: 260-269
1995
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Inverting the Turing Jump in Complexity Theory. Structure in Complexity Theory Conference 1995: 102-110
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Resource-Bounded Baire Category: A Stronger Approach. Structure in Complexity Theory Conference 1995: 182-192
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo: Weakly Useful Sequences. ICALP 1995: 393-404
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow: Beyond P^(NP) - NEXP. STACS 1995: 619-627
1994
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: Gap-Definable Counting Classes. J. Comput. Syst. Sci. 48(1): 116-148 (1994)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Almost Weakly 2-Generic Sets. J. Symb. Log. 59(3): 868-887 (1994)
1993
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li: An Oarcle Builder's Toolkit. Structure in Complexity Theory Conference 1993: 120-131
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman: On Using Oracles That Compute Values. STACS 1993: 398-407
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Lide Li: Gap-Definability as a Closure Property. STACS 1993: 484-493
1992
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: The Isomorphism Conjecture Holds Relative to an Oracle. FOCS 1992: 30-39
1991
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: Gap-Definable Counting Classes. Structure in Complexity Theory Conference 1991: 30-42
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner: Notions of Resource-Bounded Category and Genericity. Structure in Complexity Theory Conference 1991: 196-212
1989
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stephen A. Fenner, Stuart A. Kurtz, James S. Royer: Every Polynomial-Time 1-Degree Collapses iff P=PSPACE. FOCS 1989: 624-629

Coauthor Index

1Debajyoti Bera
[j20] [c21] [i9] [i7]
2Harry Buhrman
[j10] [c16] [c14]
3M. Fang
[j17]
4Lance Fortnow
[j13] [j12] [j10] [c16] [c14] [j5] [j4] [j3] [c13] [c8] [j2] [c7] [c5] [c4] [c3]
5William I. Gasarch
[j19] [j18] [i8] [c19] [j3]
6Frederic Green
[j20] [c21] [i9] [i7] [j17] [c18] [j8] [i1] [c12]
7Rohit Gurjar
[i11]
8Steven Homer
[j20] [c21] [i9] [i7] [j17] [c18] [j9] [j8] [i1] [j6] [c15] [c12] [c6]
9Arpita Korwar
[i11]
10Stuart A. Kurtz
[j15] [j13] [j4] [j2] [c7] [c4] [c3] [c1]
11Lide Li
[j13] [j5] [c7] [c5]
12Jack H. Lutz
[j16] [c9]
13Elvira Mayordomo
[j16] [c9]
14Dieter van Melkebeek
[c16]
15Ashish V. Naik
[j12] [c13]
16Mitsunori Ogihara (Mitsunori Ogiwara)
[j6] [c6]
17Brian Postow
[j19] [j18] [i8]
18Randall Pruim
[j9] [i1] [c15]
19Patrick Reardon
[j16]
20John D. Rogers
[j12] [c13]
21James S. Royer
[j15] [c1]
22Marcus Schaefer
[i5] [j9] [j7] [c15]
23Alan L. Selman
[j8] [j6] [c12] [c6]
24Thomas Thierauf
[i11] [j8] [c12]
25Leen Torenvliet
[j10]
26Heribert Vollmer
[j8] [c12]
27Yong Zhang
[c20] [j17] [i6] [c18] [c17]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Tue May 21 04:36:50 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page