On Diagonalization Methods and the Structure of Language Classes. - Kenneth W. Regan (FCT, 1983)

Arithmetical degrees of index sets for complexity classes. - Kenneth W. Regan (Logic and Machines, 1983)

A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. - Kenneth W. Regan (ICALP, 1986)

Unprovably intractable languages. - Kenneth W. Regan (SCT, 1987)

The Topology of Provability in Complexity Theory. - Kenneth W. Regan (J. Comput. Syst. Sci., 1988)

Finitary Substructure Languages. - Kenneth W. Regan (SCT, 1989)

Minimum-Complexity Pairing Functions. - Kenneth W. Regan (J. Comput. Syst. Sci., 1992)

Diagonalization, Uniformity, and Fixed-Point Theorems - Kenneth W. Regan (Inf. Comput., 1992)

On the Difference Between Turing Machine Time and Random-Access Machine Time. - Kenneth W. Regan (ICCI, 1993)

Machine models and linear time complexity. - Kenneth W. Regan (SIGACT News, 1993)

Linear-Time Algorithms in Memory Hierarchies. - Kenneth W. Regan (IFIP Congress (1), 1994)

Linear Speed-Up, Information Vicinity, and Finite-State Machines. - Kenneth W. Regan (IFIP Congress (1), 1994)

A New Parallel Vector Model, with Exact Characterization of NC^k. - Kenneth W. Regan (STACS, 1994)

The quasilinear isomorphism challenge. - Kenneth W. Regan; Jie Wang 002 (SIGACT News, 1994)

On Superlinear Lower Bounds in Complexity Theory. - Kenneth W. Regan (SCT, 1995)

Communication Complexity of Key Agreement on Small Ranges. - Jin-yi Cai; Richard J. Lipton; Luc Longpré; Mitsunori Ogihara; Kenneth W. Regan; D. Sivakumar (STACS, 1995)

Pseudorandom Generators, Measure Theory, and Natural Proofs - Kenneth W. Regan; D. Sivakumar; Jin-yi Cai (Electron. Colloquium Comput. Complex., 1995)

The Power of the Middle Bit of a #P Function. - Frederic Green; Johannes Köbler; Kenneth W. Regan; Thomas Schwentick; Jacobo Torán (J. Comput. Syst. Sci., 1995)

On Closure Properties of Bounded Two-Sided Error Complexity Classes. - Kenneth W. Regan; James S. Royer (Math. Syst. Theory, 1995)

On Quasilinear-Time Complexity Theory. - Ashish V. Naik; Kenneth W. Regan; D. Sivakumar (Theor. Comput. Sci., 1995)

Descriptive complexity and the W hierarchy. - Rodney G. Downey; Michael R. Fellows; Kenneth W. Regan (Proof Complexity and Feasible Arithmetics, 1996)

Linear Time and Memory-Efficient Computation. - Kenneth W. Regan (SIAM J. Comput., 1996)

Index Sets and Presentations of Complexity Classes. - Kenneth W. Regan (Theor. Comput. Sci., 1996)

Polynomial Vicinity Circuits and Nonlinear Lower Bounds. - Kenneth W. Regan (CCC, 1997)

Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs. - Arun K. Jagota; Kenneth W. Regan (J. Glob. Optim., 1997)

Gap-Languages and Log-Time Complexity Classes. - Kenneth W. Regan; Heribert Vollmer (Theor. Comput. Sci., 1997)

Probabilistic Martingales and BPTIME Classes. - Kenneth W. Regan; D. Sivakumar (CCC, 1998)

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). - Harry Buhrman; Dieter van Melkebeek; Kenneth W. Regan; D. Sivakumar; Martin Strauss 001 (STACS, 1998)

Information capacity of binary weights associative memories. - Arun K. Jagota; Giri Narasimhan; Kenneth W. Regan (Neurocomputing, 1998)

Parameterized Circuit Complexity and the W Hierarchy. - Rodney G. Downey; Michael R. Fellows; Kenneth W. Regan (Theor. Comput. Sci., 1998)

Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Formal Grammars and Languages. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Complexity Classes. - Eric Allender; Michael C. Loui; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Reducibility and Completeness. - Eric Allender; Michael C. Loui; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Other Complexity Classes and Measures. - Eric Allender; Michael C. Loui; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. - Harry Buhrman; Dieter van Melkebeek; Kenneth W. Regan; D. Sivakumar; Martin Strauss 001 (SIAM J. Comput., 2000)

Games with a Uniqueness Property. - Shin Aida; Marcel Crâsmaru; Kenneth W. Regan; Osamu Watanabe 001 (STACS, 2002)

Understanding the Mulmuley-Sohoni Approach to P vs. NP. - Kenneth W. Regan (Bull. EATCS, 2002)

UPSILON: Universal Programming System with Incomplete Lazy Object Notation. - Brian Postow; Kenneth W. Regan; Carl H. Smith (Fundam. Informaticae, 2002)

A Protocol for Serializing Unique Strategies. - Marcel Crâsmaru; Christian Glaßer; Kenneth W. Regan; Samik Sengupta (MFCS, 2004)

Games with Uniqueness Properties. - Shin Aida; Marcel Crâsmaru; Kenneth W. Regan; Osamu Watanabe 001 (Theory Comput. Syst., 2004)

Improved construction for universality of determinant and permanent. - Hong Liu; Kenneth W. Regan (Inf. Process. Lett., 2006)

"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. - Maurice J. Jansen; Kenneth W. Regan (COCOON, 2007)

A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. - Maurice J. Jansen; Kenneth W. Regan (Theor. Comput. Sci., 2008)

Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. - Guy Haworth; Kenneth W. Regan; Giuseppe Di Fatta (ACG, 2009)

Skill rating by Bayesian inference. - Giuseppe Di Fatta; G. McC. Haworth; Kenneth W. Regan (CIDM, 2009)

Intrinsic Chess Ratings. - Kenneth Wingate Regan; Guy McCrossan Haworth (AAAI, 2011)

Understanding Distributions of Chess Performances. - Kenneth W. Regan; Bartlomiej Macieja; Guy McCrossan Haworth (ACG, 2011)

Symmetric Functions Capture General Functions. - Richard J. Lipton; Kenneth W. Regan; Atri Rudra (MFCS, 2011)

Simulating Special but Natural Quantum Circuits - Richard J. Lipton; Kenneth W. Regan; Atri Rudra (CoRR, 2012)

Improved simulation of nondeterministic Turing machines. - Subrahmanyam Kalyanasundaram; Richard J. Lipton; Kenneth W. Regan; Farbod Shokrieh (Theor. Comput. Sci., 2012)

People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010. - Richard J. Lipton; Kenneth W. Regan (Springer, 2013)

Psychometric modeling of decision making via game play. - Kenneth W. Regan; Tamal Biswas (CIG, 2013)

Complexity Theory. - Eric Allender; Michael C. Loui; Kenneth W. Regan (Computing Handbook, 3rd ed. (1), 2014)

Human and Computer Preferences at Chess. - Kenneth Wingate Regan; Tamal Biswas; Jason Zhou (MPREF@AAAI, 2014)

Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. - Tamal Biswas; Kenneth W. Regan (AAIM, 2014)

Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets. - Robert L. Surowka; Kenneth W. Regan (CoRR, 2014)

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. - Guy Haworth; Tamal Biswas; Kenneth W. Regan (ACG, 2015)

Quantifying Depth and Complexity of Thinking and Knowledge. - Tamal T. Biswas; Kenneth W. Regan (ICAART (2), 2015)

Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. - Tamal Biswas; Kenneth W. Regan (ICMLA, 2015)

Approximation of function evaluation over sequence arguments via specialized data structures. - Tamal T. Biswas; Kenneth W. Regan (Theor. Comput. Sci., 2015)

Exact Computation of the Number of Accepting Paths of an NTM. - Subrahmanyam Kalyanasundaram; Kenneth W. Regan (CALDAM, 2018)

Hilbert's Proof of His Irreducibility Theorem. - Mark B. Villarino; William Gasarch; Kenneth W. Regan (Am. Math. Mon., 2018)

Algebraic and Logical Emulations of Quantum Circuits. - Kenneth W. Regan; Amlan Chakrabarti; Chaowen Guan (Trans. Comput. Sci., 2018)

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank. - Chaowen Guan; Kenneth W. Regan (CoRR, 2019)

Rating Computer Science via Chess - In Memoriam Daniel Kopec and Hans Berliner. - Kenneth W. Regan (Computing and Software Science, 2019)

A New Graph Polynomial and Generalized Tutte-Grothendieck Invariant from Quantum Circuits. - Chaowen Guan; Kenneth W. Regan (ACSS (1), 2020)

Multi-Structural Games and Number of Quantifiers. - Ronald Fagin; Jonathan Lenchner; Kenneth W. Regan; Nikhil Vyas 001 (Log. Methods Comput. Sci., 2025)

Extending Spike-Timing Dependent Plasticity to Learning Synaptic Delays. - Marissa Dominijanni; Alexander Ororbia; Kenneth W. Regan (CoRR, 2025)