Kenneth Regan 个人学术档案

引用次数

	总计	2019 年至今
引用	1253	328
h 指数	20	11
i10 指数	39	13

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 3 1 3 12 16 16 29 42 33 34 29 31 21 18 38 26 33 29 31 35 26 26 31 44 56 32 55 36 36 38 48 52 54 67 60 45

开放获取的出版物数量

查看全部

1 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

G McC HaworthHonorary Fellow, University of Reading在 reading.ac.uk 的电子邮件经过验证
rod downeyVictoria University, Wellington在 vuw.ac.nz 的电子邮件经过验证
Michael C. LouiPurdue University; University of Illinois at Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
Jin-Yi CaiUniversity of Wisconsin - Madison在 cs.wisc.edu 的电子邮件经过验证
Thomas SchwentickProfessor of Computer Science, TU Dortmund University在 udo.edu 的电子邮件经过验证
Mitsunori OgiharaUniversity of Miami在 cs.miami.edu 的电子邮件经过验证
Giuseppe Di FattaProfessor of Computer Science, Free University of Bozen-Bolzano在 unibz.it 的电子邮件经过验证
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft在 quantinuum.com 的电子邮件经过验证
Tao JiangUC Riverside在 cs.ucr.edu 的电子邮件经过验证
Jacobo ToranProfessor for theoretical computer science, University of Ulm在 uni-ulm.de 的电子邮件经过验证
Frederic GreenClark University在 clarku.edu 的电子邮件经过验证
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität Hannover在 thi.uni-hannover.de 的电子邮件经过验证
Farbod ShokriehUniversity of Washington在 uw.edu 的电子邮件经过验证
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at Buffalo在 buffalo.edu 的电子邮件经过验证
Denis CharlesMicrosoft Research在 microsoft.com 的电子邮件经过验证
Han LiuStudent at University of Southampton在 soton.ac.uk 的电子邮件经过验证

关注

Kenneth Regan

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

在 buffalo.edu 的电子邮件经过验证

Theoretical Computer Science Computational Complexity Theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	63	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	47	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
Gap-languages and log-time complexity classes KW Regan, H Vollmer Theoretical Computer Science 188 (1-2), 101-116, 1997	38	1997
Formal grammars and languages T Jiang, M Li, B Ravikumar, KW Regan Algorithms and Theory of Computation Handbook, Volume 1, 549-574, 2009	37	2009
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	27	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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用