Kenneth Regan
Kenneth Regan
Associate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)
Verified email at
Cited by
Cited by
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
Intrinsic chess ratings
KW Regan, GMC Haworth
Twenty-fifth aaai conference on artificial intelligence, 2011
Skill rating by Bayesian inference
G Di Fatta, GMC Haworth, KW Regan
2009 Ieee Symposium on Computational Intelligence and Data Mining, 89-94, 2009
Gap-languages and log-time complexity classes
KW Regan, H Vollmer
Theoretical Computer Science 188 (1-2), 101-116, 1997
Descriptive complexity and the W hierarchy.
RG Downey, MR Fellows, KW Regan
Proof Complexity and Feasible Arithmetics, 119-134, 1996
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
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, 27-1, 1999
On diagonalization methods and the structure of language classes
KW Regan
International Conference on Fundamentals of Computation Theory, 368-380, 1983
Quantum algorithms via linear algebra: a primer
RJ Lipton, KW Regan
MIT Press, 2014
Performance and prediction: Bayesian modelling of fallible choice in chess
G Haworth, K Regan, G Di Fatta
Advances in computer games, 99-110, 2009
Quantum Algorithms via Linear Algebra
RJ Lipton, KW Regan
MIT Press eBook 47 (3), 2993749-2993752, 2014
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
RJ Lipton, KW Regan
Springer Science & Business Media, 2013
Polynomials and combinatorial definitions of languages
K Regan
Complexity Theory Retrospective II, 261-293, 1997
The topology of provability in complexity theory
KW Regan
Journal of Computer and System Sciences 36 (3), 384-432, 1988
Understanding the Mulmuley-Sohoni Approach to P vs. NP.
KW Regan
Bulletin of the EATCS 78, 86-99, 2002
Understanding distributions of chess performances
KW Regan, B Macieja, GMC Haworth
Advances in computer games, 230-243, 2011
The system can't perform the operation now. Try again later.
Articles 1–20