Kenneth Regan

Cited by

	All	Since 2016
Citations	2211	451
h-index	19	8
i10-index	35	8

160

120

19921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202113 12 13 26 32 37 53 50 56 45 52 85 82 85 92 86 100 98 96 86 94 125 107 142 99 95 94 85 73 5

Co-authors

rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
G McC HaworthHonorary Fellow, University of ReadingVerified email at reading.ac.uk
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Michael C. LouiPurdue University; University of Illinois at Urbana-ChampaignVerified email at illinois.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Giuseppe Di FattaProfessor of Computer Science, University of Reading, UKVerified email at reading.ac.uk
Tao JiangUC RiversideVerified email at cs.ucr.edu
Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoftVerified email at cwi.nl
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
Frederic GreenClark UniversityVerified email at clarku.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Giri NarasimhanComputing and Information Sciences, Florida International UniversityVerified email at cs.fiu.edu
Farbod ShokriehUniversity of WashingtonVerified email at uw.edu
Han LiuStudent at University of SouthamptonVerified email at soton.ac.uk
Atri RudraProfessor, CSE, University at BuffaloVerified email at buffalo.edu
Denis CharlesMicrosoft ResearchVerified email at microsoft.com

Kenneth Regan

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

Verified email at buffalo.edu

Theoretical Computer Science Computational Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Algorithms and theory of computation handbook, volume 2: special topics and techniques MJ Atallah, M Blanton CRC press, 2009	841*	2009
Computer science handbook AB Tucker CRC press, 2004	352	2004
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	58	1995
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	51	1995
Parameterized circuit complexity and the W hierarchy RG Downey, MR Fellows, KW Regan Theoretical Computer Science 191 (1-2), 97-115, 1998	48	1998
Skill rating by Bayesian inference G Di Fatta, GMC Haworth, KW Regan 2009 Ieee Symposium on Computational Intelligence and Data Mining, 89-94, 2009	41	2009
Descriptive complexity and the Ï-hierarchy RG Downey, MR Fellows, K Regan Proof Complexity and Feasible Arithmetic 39, 119-134, 1998	39	1998
Intrinsic chess ratings K Regan, G Haworth Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011	38	2011
Gap-languages and log-time complexity classes KW Regan, H Vollmer Theoretical Computer Science 188 (1-2), 101-116, 1997	38	1997
Threshold dominating sets and an improved characterization of W [2] RG Downey, MR Fellows Theoretical Computer Science 209 (1-2), 123-140, 1998	37	1998
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	35	2000
On quasilinear-time complexity theory AV Naik, KW Regan, D Sivakumar Theoretical Computer Science 148 (2), 325-349, 1995	34	1995
Formal grammars and languages T Jiang, M Li, B Ravikumar, KW Regan Algorithms and theory of computation handbook, 20-26, 2010	29*	2010
On diagonalization methods and the structure of language classes KW Regan International Conference on Fundamentals of Computation Theory, 368-380, 1983	25	1983
Complexity Classes. E Allender, MC Loui, KW Regan Algorithms and theory of computation handbook, 27-1, 1999	23	1999
Performance and prediction: Bayesian modelling of fallible choice in chess G Haworth, K Regan, G Di Fatta Advances in computer games, 99-110, 2009	22	2009
Quantum algorithms via linear algebra: a primer RJ Lipton, KW Regan MIT Press, 2014	20	2014
Quantum Algorithms via Linear Algebra RJ Lipton, KW Regan MIT Press, 2014	20	2014
Polynomials and combinatorial definitions of languages K Regan Complexity Theory Retrospective II, 261-293, 1997	19	1997
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010 RJ Lipton, KW Regan Springer Science & Business Media, 2013	18	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors