Kenneth Regan
Kenneth Regan
Associate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)
Verified email at buffalo.edu
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
821*2009
Computer science handbook
AB Tucker
CRC press, 2004
3402004
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
581995
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
511995
Parameterized circuit complexity and the W hierarchy
RG Downey, MR Fellows, KW Regan
Theoretical Computer Science 191 (1-2), 97-115, 1998
471998
Skill rating by Bayesian inference
G Di Fatta, GMC Haworth, KW Regan
2009 Ieee Symposium on Computational Intelligence and Data Mining, 89-94, 2009
382009
Descriptive complexity and the Ď-hierarchy
RG Downey, MR Fellows, K Regan
Proof Complexity and Feasible Arithmetic 39, 119-134, 1998
381998
Gap-languages and log-time complexity classes
KW Regan, H Vollmer
Theoretical Computer Science 188 (1-2), 101-116, 1997
381997
Intrinsic chess ratings
KW Regan, GMC Haworth
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
352011
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
352000
Threshold dominating sets and an improved characterization of W [2]
RG Downey, MR Fellows
Theoretical Computer Science 209 (1-2), 123-140, 1998
341998
On quasilinear-time complexity theory
AV Naik, KW Regan, D Sivakumar
Theoretical Computer Science 148 (2), 325-349, 1995
341995
Formal grammars and languages
T Jiang, M Li, B Ravikumar, KW Regan
Algorithms and theory of computation handbook, 20-26, 2010
28*2010
On diagonalization methods and the structure of language classes
KW Regan
International Conference on Fundamentals of Computation Theory, 368-380, 1983
251983
Complexity Classes.
E Allender, MC Loui, KW Regan
Algorithms and theory of computation handbook, 27-1, 1999
221999
Performance and prediction: Bayesian modelling of fallible choice in chess
G Haworth, K Regan, G Di Fatta
Advances in computer games, 99-110, 2009
212009
Polynomials and combinatorial definitions of languages
K Regan
Complexity Theory Retrospective II, 261-293, 1997
191997
Quantum Algorithms via Linear Algebra
RJ Lipton, KW Regan
MIT Press, 2014
182014
Understanding the Mulmuley-Sohoni Approach to P vs. NP.
KW Regan
Bulletin of the EATCS 78, 86-99, 2002
182002
People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010
RJ Lipton, KW Regan
Springer Science & Business Media, 2013
172013
The system can't perform the operation now. Try again later.
Articles 1–20