Kenneth Regan

Citado por

	Total	Desde 2019
Citas	1260	335
Índice h	20	11
Índice i10	39	13

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 3 1 3 12 16 16 29 42 33 34 29 31 21 18 38 26 33 29 31 35 27 26 31 44 56 32 55 36 36 38 48 52 54 66 61 52

Acceso público

Ver todo

1 artículo

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

G McC HaworthHonorary Fellow, University of ReadingDirección de correo verificada de reading.ac.uk
rod downeyVictoria University, WellingtonDirección de correo verificada de vuw.ac.nz
Michael C. LouiPurdue University; University of Illinois at Urbana-ChampaignDirección de correo verificada de illinois.edu
Eric AllenderRutgers UniversityDirección de correo verificada de cs.rutgers.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonDirección de correo verificada de cs.wisc.edu
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityDirección de correo verificada de udo.edu
Mitsunori OgiharaUniversity of MiamiDirección de correo verificada de cs.miami.edu
Giuseppe Di FattaProfessor of Computer Science, Free University of Bozen-BolzanoDirección de correo verificada de unibz.it
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftDirección de correo verificada de quantinuum.com
Tao JiangUC RiversideDirección de correo verificada de cs.ucr.edu
Jacobo ToranProfessor for theoretical computer science, University of UlmDirección de correo verificada de uni-ulm.de
Frederic GreenClark UniversityDirección de correo verificada de clarku.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverDirección de correo verificada de thi.uni-hannover.de
Farbod ShokriehUniversity of WashingtonDirección de correo verificada de uw.edu
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at BuffaloDirección de correo verificada de buffalo.edu
Denis CharlesMicrosoft ResearchDirección de correo verificada de microsoft.com
Han LiuStudent at University of SouthamptonDirección de correo verificada de soton.ac.uk

Seguir

Kenneth Regan

Associate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)

Dirección de correo verificada de buffalo.edu

Theoretical Computer Science Computational Complexity Theory


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Quantum algorithms via linear algebra: a primer RJ Lipton, KW Regan MIT Press, 2014	71*	2014
Intrinsic chess ratings K Regan, G Haworth Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 834-839, 2011	64	2011
Pseudorandom generators, measure theory, and natural proofs KW Regan, D Sivakumar, JY Cai Proceedings of IEEE 36th Annual Foundations of Computer Science, 26-35, 1995	63	1995
Parameterized circuit complexity and the W hierarchy RG Downey, MR Fellows, KW Regan Theoretical Computer Science 191 (1-2), 97-115, 1998	58	1998
The power of the middle bit of a# P function F Green, J Kobler, KW Regan, T Schwentick, J Torán Journal of Computer and System Sciences 50 (3), 456-467, 1995	54	1995
Descriptive complexity and the W hierarchy RG Downey, MR Fellows, KW Regan Proof Complexity and Feasible Arithmetics, 119-134, 1996	48	1996
Skill rating by Bayesian inference G Di Fatta, GMC Haworth, KW Regan 2009 Ieee Symposium on Computational Intelligence and Data Mining, 89-94, 2009	43	2009
A generalization of resource-bounded measure, with application to the BPP vs. EXP problem H Buhrman, D Van Melkebeek, KW Regan, D Sivakumar, M Strauss SIAM Journal on Computing 30 (2), 576-601, 2000	42	2000
On quasilinear-time complexity theory AV Naik, KW Regan, D Sivakumar Theoretical Computer Science 148 (2), 325-349, 1995	39	1995
Formal grammars and languages T Jiang, M Li, B Ravikumar, KW Regan Algorithms and Theory of Computation Handbook, Volume 1, 549-574, 2009	38	2009
Gap-languages and log-time complexity classes KW Regan, H Vollmer Theoretical Computer Science 188 (1-2), 101-116, 1997	38	1997
Complexity Classes. E Allender, MC Loui, KW Regan Algorithms and theory of computation handbook 1, 597-620, 1999	37	1999
Performance and prediction: Bayesian modelling of fallible choice in chess G Haworth, K Regan, G Di Fatta Advances in Computer Games: 12th International Conference, ACG 2009 …, 2010	29	2010
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010 RJ Lipton, KW Regan Springer, 2013	28	2013
The topology of provability in complexity theory KW Regan Journal of Computer and System Sciences 36 (3), 384-432, 1988	25	1988
On diagonalization methods and the structure of language classes KW Regan International Conference on Fundamentals of Computation Theory, 368-380, 1983	25	1983
Understanding distributions of chess performances KW Regan, B Macieja, GMC Haworth Advances in computer games, 230-243, 2011	23	2011
Human and computer preferences at chess KW Regan, T Biswas, J Zhou Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014	22	2014
Measuring level-k reasoning, satisficing, and human error in game-play data T Biswas, K Regan 2015 IEEE 14th International Conference on Machine Learning and Applications …, 2015	21	2015
Understanding the Mulmuley-Sohoni Approach to P vs. NP. KW Regan Bulletin of the EATCS 78, 86-99, 2002	20	2002

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores