default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen A. Fenner
Person information
- affiliation: University of South Carolina, Columbia, SC, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j34]Stephen A. Fenner, Rabins Wosti:
Implementing the quantum fanout operation with simple pairwise interactions. Quantum Inf. Comput. 23(13&14): 1081-1090 (2023)- 2022
- [j33]Stephen A. Fenner, Daniel Padé, Thomas Thierauf:
The complexity of regex crosswords. Inf. Comput. 286: 104777 (2022) - [j32]Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
The Complexity of Poset Games. J. Graph Algorithms Appl. 26(1): 1-14 (2022) - [i19]Stephen A. Fenner, Rabins Wosti:
Implementing the fanout operation with simple pairwise interactions. CoRR abs/2203.01141 (2022) - 2021
- [j31]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in Quasi-NC. SIAM J. Comput. 50(3) (2021) - [j30]Stephen A. Fenner:
Review of The Theory of Quantum Information John Watrous. SIGACT News 52(1): 16-24 (2021) - [j29]Stephen A. Fenner:
Remembrances of Alan. SIGACT News 52(1): 87-93 (2021) - 2020
- [i18]Daniel Padé, Stephen A. Fenner, Daniel Grier, Thomas Thierauf:
Depth-2 QAC circuits cannot simulate quantum parity. CoRR abs/2005.12169 (2020)
2010 – 2019
- 2019
- [j28]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
A deterministic parallel algorithm for bipartite perfect matching. Commun. ACM 62(3): 109-115 (2019) - [c25]Stephen A. Fenner, Daniel Padé:
Complexity of Regex Crosswords. LATA 2019: 215-230 - 2018
- [j27]Stephen A. Fenner, Frederic Green, Steven Homer:
Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. SIGACT News 49(3): 35-47 (2018) - 2017
- [j26]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Guest Column: Parallel Algorithms for Perfect Matching. SIGACT News 48(1): 102-109 (2017) - [i17]Stephen A. Fenner, Lance Fortnow:
Compression Complexity. CoRR abs/1702.04779 (2017) - 2016
- [c24]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite perfect matching is in quasi-NC. STOC 2016: 754-763 - [i16]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. CoRR abs/1601.06319 (2016) - 2015
- [j25]Stephen A. Fenner, John D. Rogers:
Combinatorial Game Complexity: An Introduction with Poset Games. Bull. EATCS 116 (2015) - [j24]Stephen A. Fenner, Yong Zhang:
Quantum Algorithms for a Set of Group Theoretic Problems. Int. J. Found. Comput. Sci. 26(2): 255-268 (2015) - [c23]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. ISAAC 2015: 689-699 - [i15]Stephen A. Fenner, John D. Rogers:
Combinatorial Game Complexity: An Introduction with Poset Games. CoRR abs/1505.07416 (2015) - [i14]Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i12]Stephen A. Fenner:
The complexity of some regex crossword problems. CoRR abs/1411.5437 (2014) - 2013
- [j23]Stephen A. Fenner:
Functions that preserve p-randomness. Inf. Comput. 231: 125-142 (2013) - [j22]Stephen A. Fenner, Yong Zhang:
On the Complexity of the Hidden Subgroup Problem. Int. J. Found. Comput. Sci. 24(8): 1221-1234 (2013) - [i11]Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
On Two-Level Poset Games. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i10]Stephen A. Fenner:
Functions that preserve p-randomness. CoRR abs/1202.6395 (2012) - 2011
- [j21]Joshua N. Cooper
, Stephen A. Fenner, Semmy Purewal:
Monochromatic Boxes in Colored Grids. SIAM J. Discret. Math. 25(3): 1054-1068 (2011) - [c22]Stephen A. Fenner:
Functions That Preserve p-Randomness. FCT 2011: 336-347 - 2010
- [j20]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Efficient universal quantum circuits. Quantum Inf. Comput. 10(1&2): 16-27 (2010)
2000 – 2009
- 2009
- [j19]Stephen A. Fenner, William I. Gasarch, Brian Postow:
The complexity of learning SUBSEQ(A). J. Symb. Log. 74(3): 939-975 (2009) - [j18]Stephen A. Fenner, William I. Gasarch, Brian Postow:
The Complexity of Finding SUBSEQ(A). Theory Comput. Syst. 45(3): 577-612 (2009) - [c21]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Efficient Universal Quantum Circuits. COCOON 2009: 418-428 - 2008
- [c20]Stephen A. Fenner, Yong Zhang:
On the Complexity of the Hidden Subgroup Problem. TAMC 2008: 70-81 - [i9]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Universal Quantum Circuits. CoRR abs/0804.2429 (2008) - [i8]Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer:
Universal Quantum Circuits. Electron. Colloquium Comput. Complex. TR08 (2008) - [i7]Stephen A. Fenner, William I. Gasarch, Brian Postow:
The complexity of learning SUBSEQ(A). Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [j17]M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang:
Quantum lower bounds for fanout. Quantum Inf. Comput. 6(1): 46-57 (2006) - [c19]Stephen A. Fenner, William I. Gasarch:
The Complexity of Learning SUBSEQ (A). ALT 2006: 109-123 - [i6]Stephen A. Fenner, Yong Zhang:
The central nature of the Hidden Subgroup problem. CoRR abs/cs/0610086 (2006) - 2005
- [j16]Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon:
Weakly useful sequences. Inf. Comput. 197(1-2): 41-54 (2005) - [c18]Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang:
Bounds on the Power of Constant-Depth Quantum Circuits. FCT 2005: 44-55 - [c17]Stephen A. Fenner, Yong Zhang:
Quantum Algorithms for a Set of Group Theoretic Problems. ICTCS 2005: 215-227 - 2004
- [j15]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) - [i5]Marcus Schaefer, Stephen A. Fenner:
Simplicity and Strong Reductions. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j14]Stephen A. Fenner:
A physics-free introduction to the quantum computation model, Computational Complexity Column. Bull. EATCS 79: 69-85 (2003) - [j13]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li:
An oracle builder's toolkit. Inf. Comput. 182(2): 95-136 (2003) - [j12]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003) - [j11]Stephen A. Fenner:
PP-Lowness and a Simple Definition of AWPP. Theory Comput. Syst. 36(2): 199-212 (2003) - [i4]Stephen A. Fenner:
A Physics-Free Introduction to the Quantum Computation Model. CoRR cs.CC/0304008 (2003) - 2002
- [i3]Stephen A. Fenner:
Gales and supergales are equivalent for defining constructive Hausdorff dimension. CoRR cs.CC/0208044 (2002) - [i2]Stephen A. Fenner:
PP-lowness and a simple definition of AWPP. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j10]Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet:
Two oracles that force a big crunch. Comput. Complex. 10(2): 93-116 (2001) - [j9]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
- [c16]Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek:
Optimal Proof Systems and Sparse Sets. STACS 2000: 407-418
1990 – 1999
- 1999
- [j8]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j7]Stephen A. Fenner, Marcus Schaefer:
Bounded Immunity and Btt-Reductions. Math. Log. Q. 45: 3-21 (1999) - [i1]Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim:
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR99 (1999) - 1997
- [j6]Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman:
Oracles that Compute Values. SIAM J. Comput. 26(4): 1043-1065 (1997) - [c15]Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer:
Hyper-Polynomial Hierarchies and the NP-Jump. CCC 1997: 102-110 - [c14]Harry Buhrman, Stephen A. Fenner, Lance Fortnow:
Results on Resource-Bounded Measure. ICALP 1997: 188-194 - 1996
- [j5]Stephen A. Fenner, Lance Fortnow, Lide Li:
Gap-Definability as a Closure Property. Inf. Comput. 130(1): 1-17 (1996) - [j4]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
The Isomorphism Conjecture Holds Relative to an Oracle. SIAM J. Comput. 25(1): 193-206 (1996) - [j3]Stephen A. Fenner, Lance Fortnow, William I. Gasarch:
Complexity Theory Newsflash. SIGACT News 27(3): 126 (1996) - [c13]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting Onto Functions. CCC 1996: 213-222 - [c12]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269 - 1995
- [c11]Stephen A. Fenner:
Inverting the Turing Jump in Complexity Theory. SCT 1995: 102-110 - [c10]Stephen A. Fenner:
Resource-Bounded Baire Category: A Stronger Approach. SCT 1995: 182-192 - [c9]Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo:
Weakly Useful Sequences. ICALP 1995: 393-404 - [c8]Stephen A. Fenner, Lance Fortnow:
Beyond P^(NP) - NEXP. STACS 1995: 619-627 - 1994
- [j2]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
Gap-Definable Counting Classes. J. Comput. Syst. Sci. 48(1): 116-148 (1994) - [j1]Stephen A. Fenner:
Almost Weakly 2-Generic Sets. J. Symb. Log. 59(3): 868-887 (1994) - 1993
- [c7]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li:
An Oarcle Builder's Toolkit. SCT 1993: 120-131 - [c6]Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman:
On Using Oracles That Compute Values. STACS 1993: 398-407 - [c5]Stephen A. Fenner, Lance Fortnow, Lide Li:
Gap-Definability as a Closure Property. STACS 1993: 484-493 - 1992
- [c4]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
The Isomorphism Conjecture Holds Relative to an Oracle. FOCS 1992: 30-39 - 1991
- [c3]Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
Gap-Definable Counting Classes. SCT 1991: 30-42 - [c2]Stephen A. Fenner:
Notions of Resource-Bounded Category and Genericity. SCT 1991: 196-212
1980 – 1989
- 1989
- [c1]Stephen A. Fenner, Stuart A. Kurtz, James S. Royer:
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE. FOCS 1989: 624-629
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
