Stephen Fenner

Citado por

	Todos	Desde 2019
Citações	1404	314
Índice h	19	10
Índice i10	32	10

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 5 27 39 34 45 35 48 43 34 39 35 79 56 46 45 42 39 31 21 31 30 26 24 40 45 41 45 51 55 56 70 41 41

Acesso público

Ver todos

9 artigos

2 artigos

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Lance FortnowIllinois Institute of TechnologyE-mail confirmado em iit.edu
Frederic GreenClark UniversityE-mail confirmado em clarku.edu
Steve HomerProfessor, CS, Boston UniversityE-mail confirmado em cs.bu.edu
Rohit GurjarCalifornia institute of technologyE-mail confirmado em caltech.edu
Randall PruimProfessor of Mathematics and Statistics, Calvin CollegeE-mail confirmado em calvin.edu
Mitsunori OgiharaUniversity of MiamiE-mail confirmado em cs.miami.edu
Marcus SchaeferDePaul UniversityE-mail confirmado em cdm.depaul.edu
Debajyoti BeraIIIT-DelhiE-mail confirmado em iiitd.ac.in
Ashish NaikGoogleE-mail confirmado em google.com
Daniel GrierAssistant Professor, University of California, San DiegoE-mail confirmado em ucsd.edu
Elvira MayordomoUniversidad de Zaragoza, University of ZaragozaE-mail confirmado em unizar.es
Jack H. LutzIowa State UniversityE-mail confirmado em cs.iastate.edu
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftE-mail confirmado em quantinuum.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverE-mail confirmado em thi.uni-hannover.de
Joshua CooperProfessor, University of South CarolinaE-mail confirmado em math.sc.edu
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

Seguir

Stephen Fenner

Professor of Computer Science and Engineering, University of South Carolina

E-mail confirmado em cec.sc.edu - Página inicial

Theoretical Computer Science Computational Complexity Quantum Informatics


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	314	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	110	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	93	1999
Inverting onto functions SA Fenner, L Fortnow, AV Naik, JD Rogers Information and Computation 186 (1), 90-103, 2003	67	2003
Quantum lower bounds for fanout M Fang, S Fenner, F Green, S Homer, Y Zhang arXiv preprint quant-ph/0312208, 2003	42	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	23	2015
Efficient universal quantum circuits D Bera, S Fenner, F Green, S Homer Quantum Information & Computation 10 (1), 16-28, 2010	23	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

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores