Kenneth Regan
Kenneth Regan
Associate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)
Verified email at
Cited by
Cited by
Quantum algorithms via linear algebra: a primer
RJ Lipton, KW Regan
MIT Press, 2014
Intrinsic chess ratings
K Regan, G Haworth
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 834-839, 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
Parameterized circuit complexity and the W hierarchy
RG Downey, MR Fellows, KW Regan
Theoretical Computer Science 191 (1-2), 97-115, 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
Descriptive complexity and the W hierarchy
RG Downey, MR Fellows, KW Regan
Proof Complexity and Feasible Arithmetics, 119-134, 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
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
On quasilinear-time complexity theory
AV Naik, KW Regan, D Sivakumar
Theoretical Computer Science 148 (2), 325-349, 1995
Gap-languages and log-time complexity classes
KW Regan, H Vollmer
Theoretical Computer Science 188 (1-2), 101-116, 1997
Formal grammars and languages
T Jiang, M Li, B Ravikumar, KW Regan
Algorithms and Theory of Computation Handbook, Volume 1, 549-574, 2009
Complexity Classes.
E Allender, MC Loui, KW Regan
Algorithms and theory of computation handbook 1, 597-620, 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
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
RJ Lipton, KW Regan
Springer, 2013
The topology of provability in complexity theory
KW Regan
Journal of Computer and System Sciences 36 (3), 384-432, 1988
On diagonalization methods and the structure of language classes
KW Regan
International Conference on Fundamentals of Computation Theory, 368-380, 1983
Understanding distributions of chess performances
KW Regan, B Macieja, GMC Haworth
Advances in computer games, 230-243, 2011
Human and computer preferences at chess
KW Regan, T Biswas, J Zhou
Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence, 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
Understanding the Mulmuley-Sohoni Approach to P vs. NP.
KW Regan
Bulletin of the EATCS 78, 86-99, 2002
The system can't perform the operation now. Try again later.
Articles 1–20