Stephen A. Fenner

	2012
52		Stephen A. Fenner: Functions that preserve p-randomness CoRR abs/1202.6395: (2012)
	2011
51		Stephen A. Fenner: Functions That Preserve p-Randomness. FCT 2011: 336-347
	2010
50		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient universal quantum circuits. Quantum Information & Computation 10(1&2): 16-27 (2010)
	2009
49		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Efficient Universal Quantum Circuits. COCOON 2009: 418-428
48		Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). J. Symb. Log. 74(3): 939-975 (2009)
47		Stephen A. Fenner, William I. Gasarch, Brian Postow: The Complexity of Finding SUBSEQ(A). Theory Comput. Syst. 45(3): 577-612 (2009)
	2008
46		Stephen A. Fenner, Yong Zhang: On the Complexity of the Hidden Subgroup Problem. TAMC 2008: 70-81
45		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits CoRR abs/0804.2429: (2008)
44		Stephen A. Fenner, William I. Gasarch, Brian Postow: The complexity of learning SUBSEQ(A). Electronic Colloquium on Computational Complexity (ECCC) 15(053): (2008)
43		Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer: Universal Quantum Circuits. Electronic Colloquium on Computational Complexity (ECCC) 15(078): (2008)
	2006
42		Stephen A. Fenner, William I. Gasarch: The Complexity of Learning SUBSEQ (A). ALT 2006: 109-123
41		Stephen A. Fenner, Yong Zhang: The central nature of the Hidden Subgroup problem CoRR abs/cs/0610086: (2006)
40		M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Quantum lower bounds for fanout. Quantum Information & Computation 6(1): 46-57 (2006)
	2005
39		Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang: Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55
38		Stephen A. Fenner, Yong Zhang: Quantum Algorithms for a Set of Group Theoretic Problems. ICTCS 2005: 215-227
37		Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon: Weakly useful sequences. Inf. Comput. 197(1-2): 41-54 (2005)
	2004
36		Marcus Schaefer, Stephen A. Fenner: Simplicity and Strong Reductions Electronic Colloquium on Computational Complexity (ECCC)(071): (2004)
35		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)
	2003
34		Stephen A. Fenner: A physics-free introduction to the quantum computation model, Computational Complexity Column. Bulletin of the EATCS 79: 69-85 (2003)
33		Stephen A. Fenner: A Physics-Free Introduction to the Quantum Computation Model CoRR cs.CC/0304008: (2003)
32		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li: An oracle builder's toolkit. Inf. Comput. 182(2): 95-136 (2003)
31		Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003)
30		Stephen A. Fenner: PP-Lowness and a Simple Definition of AWPP. Theory Comput. Syst. 36(2): 199-212 (2003)
	2002
29		Stephen A. Fenner: Gales and supergales are equivalent for defining constructive Hausdorff dimension CoRR cs.CC/0208044: (2002)
28		Stephen A. Fenner: PP-lowness and a simple definition of AWPP Electronic Colloquium on Computational Complexity (ECCC)(036): (2002)
	2001
27		Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet: Two oracles that force a big crunch. Computational Complexity 10(2): 93-116 (2001)
26		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
25		Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek: Optimal Proof Systems and Sparse Sets. STACS 2000: 407-418
	1999
24		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)
23		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)
22		Stephen A. Fenner, Marcus Schaefer: Bounded Immunity and Btt-Reductions. Math. Log. Q. 45: 3-21 (1999)
	1997
21		Harry Buhrman, Stephen A. Fenner, Lance Fortnow: Results on Resource-Bounded Measure. ICALP 1997: 188-194
20		Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer: Hyper-Polynomial Hierarchies and the NP-Jump. IEEE Conference on Computational Complexity 1997: 102-110
19		Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman: Oracles that Compute Values. SIAM J. Comput. 26(4): 1043-1065 (1997)
	1996
18		Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting Onto Functions. IEEE Conference on Computational Complexity 1996: 213-222
17		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
16		Stephen A. Fenner, Lance Fortnow, Lide Li: Gap-Definability as a Closure Property. Inf. Comput. 130(1): 1-17 (1996)
15		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: The Isomorphism Conjecture Holds Relative to an Oracle. SIAM J. Comput. 25(1): 193-206 (1996)
14		Stephen A. Fenner, Lance Fortnow, William I. Gasarch: Complexity Theory Newsflash. SIGACT News 27(3): 126 (1996)
	1995
13		Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo: Weakly Useful Sequences. ICALP 1995: 393-404
12		Stephen A. Fenner, Lance Fortnow: Beyond P^(NP) - NEXP. STACS 1995: 619-627
11		Stephen A. Fenner: Inverting the Turing Jump in Complexity Theory. Structure in Complexity Theory Conference 1995: 102-110
10		Stephen A. Fenner: Resource-Bounded Baire Category: A Stronger Approach. Structure in Complexity Theory Conference 1995: 182-192
	1994
9		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: Gap-Definable Counting Classes. J. Comput. Syst. Sci. 48(1): 116-148 (1994)
8		Stephen A. Fenner: Almost Weakly 2-Generic Sets. J. Symb. Log. 59(3): 868-887 (1994)
	1993
7		Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman: On Using Oracles That Compute Values. STACS 1993: 398-407
6		Stephen A. Fenner, Lance Fortnow, Lide Li: Gap-Definability as a Closure Property. STACS 1993: 484-493
5		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li: An Oarcle Builder's Toolkit. Structure in Complexity Theory Conference 1993: 120-131
	1992
4		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: The Isomorphism Conjecture Holds Relative to an Oracle FOCS 1992: 30-39
	1991
3		Stephen A. Fenner: Notions of Resource-Bounded Category and Genericity. Structure in Complexity Theory Conference 1991: 196-212
2		Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz: Gap-Definable Counting Classes. Structure in Complexity Theory Conference 1991: 30-42
	1989
1		Stephen A. Fenner, Stuart A. Kurtz, James S. Royer: Every Polynomial-Time 1-Degree Collapses iff P=PSPACE FOCS 1989: 624-629

Coauthor Index

1	Debajyoti Bera	[43] [45] [49] [50]
2	Harry Buhrman	[21] [25] [27]
3	M. Fang	[40]
4	Lance Fortnow	[2] [4] [5] [6] [9] [12] [14] [15] [16] [18] [21] [25] [27] [31] [32]
5	William I. Gasarch	[14] [42] [44] [47] [48]
6	Frederic Green	[17] [23] [24] [39] [40] [43] [45] [49] [50]
7	Steven Homer	[7] [17] [19] [20] [23] [24] [26] [39] [40] [43] [45] [49] [50]
8	Stuart A. Kurtz	[1] [2] [4] [5] [9] [15] [32] [35]
9	Lide Li	[5] [6] [16] [32]
10	Jack H. Lutz	[13] [37]
11	Elvira Mayordomo	[13] [37]
12	Dieter van Melkebeek	[25]
13	Ashish V. Naik	[18] [31]
14	Mitsunori Ogihara (Mitsunori Ogiwara)	[7] [19]
15	Brian Postow	[44] [47] [48]
16	Randall Pruim	[20] [23] [26]
17	Patrick Reardon	[37]
18	John D. Rogers	[18] [31]
19	James S. Royer	[1] [35]
20	Marcus Schaefer	[20] [22] [26] [36]
21	Alan L. Selman	[7] [17] [19] [24]
22	Thomas Thierauf	[17] [24]
23	Leen Torenvliet	[27]
24	Heribert Vollmer	[17] [24]
25	Yong Zhang	[38] [39] [40] [41] [46]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page