Stephen Fenner

Citeras av

	Alla	Sedan 2020
Citat	1450	303
h-index	18	9
i10-index	33	7

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420256 5 28 40 37 43 34 47 44 32 38 33 85 56 46 45 41 38 32 22 30 30 28 23 40 44 40 46 50 55 57 69 35 77 10

Offentlig åtkomst

Visa alla

9 artiklar

2 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Lance FortnowIllinois Institute of TechnologyVerifierad e-postadress på iit.edu
Frederic GreenClark UniversityVerifierad e-postadress på clarku.edu
Steve HomerProfessor, CS, Boston UniversityVerifierad e-postadress på cs.bu.edu
Rohit GurjarCalifornia institute of technologyVerifierad e-postadress på caltech.edu
Randall PruimProfessor of Mathematics and Statistics, Calvin CollegeVerifierad e-postadress på calvin.edu
Mitsunori OgiharaUniversity of MiamiVerifierad e-postadress på cs.miami.edu
Marcus SchaeferDePaul UniversityVerifierad e-postadress på cdm.depaul.edu
Debajyoti BeraIIIT-DelhiVerifierad e-postadress på iiitd.ac.in
Daniel GrierAssistant Professor, University of California, San DiegoVerifierad e-postadress på ucsd.edu
Ashish NaikGoogleVerifierad e-postadress på google.com
Elvira MayordomoUniversidad de Zaragoza, University of ZaragozaVerifierad e-postadress på unizar.es
Jack H. LutzIowa State UniversityVerifierad e-postadress på cs.iastate.edu
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerifierad e-postadress på quantinuum.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerifierad e-postadress på thi.uni-hannover.de
Joshua CooperProfessor, University of South CarolinaVerifierad e-postadress på math.sc.edu
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

Följ

Stephen Fenner

Professor of Computer Science and Engineering, University of South Carolina

Verifierad e-postadress på cec.sc.edu - Startsida

Theoretical Computer Science Computational Complexity Quantum Informatics


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	322	1994
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy S Fenner, F Green, S Homer, R Pruim Proceedings of the Royal Society of London. Series A: Mathematical, Physical …, 1999	117*	1999
Bipartite perfect matching is in quasi-NC S Fenner, R Gurjar, T Thierauf Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	115	2016
An oracle builder’s toolkit S Fenner, L Fortnow, SA Kurtz, L Li Information and Computation 182 (2), 95-136, 2003	110	2003
Inverting onto functions SA Fenner, L Fortnow, AV Naik, JD Rogers Information and Computation 186 (1), 90-103, 2003	69	2003
Quantum lower bounds for fanout M Fang, S Fenner, F Green, S Homer, Y Zhang arXiv preprint quant-ph/0312208, 2003	54	2003
Bounds on the power of constant-depth quantum circuits S Fenner, F Green, S Homer, Y Zhang International Symposium on Fundamentals of Computation Theory, 44-55, 2005	40	2005
PP-lowness and a simple definition of AWPP SA Fenner Theory of Computing Systems 36, 199-212, 2003	37	2003
The isomorphism conjecture holds relative to an oracle S Fenner, L Fortnow, SA Kurtz SIAM Journal on Computing 25 (1), 193-206, 1996	37	1996
Notions of Resource-Bounded Category and Genericity. SA Fenner SCT, 196-212, 1991	37	1991
Rectangle free coloring of grids S Fenner, W Gasarch, C Glover, S Purewal arXiv preprint arXiv:1005.3750, 2010	36	2010
Oracles that compute values S Fenner, S Homer, M Ogihara, A Selman SIAM Journal on Computing 26 (4), 1043-1065, 1997	33	1997
On using oracles that compute values S Fenner, S Homer, M Ogiwara, AL Selman STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science …, 1993	33	1993
Efficient universal quantum circuits D Bera, S Fenner, F Green, S Homer Quantum Information & Computation 10 (1), 16-28, 2010	24	2010
Combinatorial game complexity: an introduction with poset games SA Fenner, J Rogers arXiv preprint arXiv:1505.07416, 2015	22	2015
Resource-bounded Baire category: a stronger approach SA Fenner Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995	21	1995
Gales and supergales are equivalent for defining constructive Hausdorff dimension SA Fenner arXiv preprint cs/0208044, 2002	20	2002
Complements of multivalued functions S Fenner, F Green, S Homer, AL Selman, T Thierauf, H Vollmer Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996	19	1996
Universal quantum computation with two-and three-qubit projective measurements SA Fenner, Y Zhang arXiv preprint quant-ph/0111077, 2001	17	2001
Quantum algorithms for a set of group theoretic problems SA Fenner, Y Zhang Italian Conference on Theoretical Computer Science, 215-227, 2005	16	2005

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare