Stephen Fenner

Citata da

	Tutte	Dal 2019
Citazioni	1434	341
Indice H	19	10
i10-index	33	12

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 5 27 39 34 45 35 48 43 32 39 38 81 56 46 45 42 39 31 21 31 30 25 24 40 45 41 45 51 55 54 73 40 68

Accesso pubblico

Visualizza tutto

9 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Lance FortnowIllinois Institute of TechnologyEmail verificata su iit.edu
Frederic GreenClark UniversityEmail verificata su clarku.edu
Steve HomerProfessor, CS, Boston UniversityEmail verificata su cs.bu.edu
Rohit GurjarCalifornia institute of technologyEmail verificata su caltech.edu
Randall PruimProfessor of Mathematics and Statistics, Calvin CollegeEmail verificata su calvin.edu
Mitsunori OgiharaUniversity of MiamiEmail verificata su cs.miami.edu
Marcus SchaeferDePaul UniversityEmail verificata su cdm.depaul.edu
Debajyoti BeraIIIT-DelhiEmail verificata su iiitd.ac.in
Daniel GrierAssistant Professor, University of California, San DiegoEmail verificata su ucsd.edu
Ashish NaikGoogleEmail verificata su google.com
Elvira MayordomoUniversidad de Zaragoza, University of ZaragozaEmail verificata su unizar.es
Jack H. LutzIowa State UniversityEmail verificata su cs.iastate.edu
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftEmail verificata su quantinuum.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverEmail verificata su thi.uni-hannover.de
Joshua CooperProfessor, University of South CarolinaEmail verificata su math.sc.edu
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

Segui

Stephen Fenner

Professor of Computer Science and Engineering, University of South Carolina

Email verificata su cec.sc.edu - Home page

Theoretical Computer Science Computational Complexity Quantum Informatics


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	316	1994
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	112	2016
An oracle builder’s toolkit S Fenner, L Fortnow, SA Kurtz, L Li Information and Computation 182 (2), 95-136, 2003	108	2003
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	94	1999
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	52	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	39	2005
The isomorphism conjecture holds relative to an oracle S Fenner, L Fortnow, SA Kurtz SIAM Journal on Computing 25 (1), 193-206, 1996	38	1996
PP-lowness and a simple definition of AWPP SA Fenner Theory of Computing Systems 36, 199-212, 2003	37	2003
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	32	1993
Combinatorial game complexity: an introduction with poset games SA Fenner, J Rogers arXiv preprint arXiv:1505.07416, 2015	24	2015
Efficient universal quantum circuits D Bera, S Fenner, F Green, S Homer Quantum Information & Computation 10 (1), 16-28, 2010	24	2010
Quantum NP is hard for PH S Fenner, F Green, S Homer, R Pruim Proceedings of 6th Italian Conference on theoretical Computer Science, 241-252, 1998	22	1998
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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori