Kenneth W. Regan

According to our database, Kenneth W. Regan authored at least 68 papers between 1983 and 2021.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2021

Multi-Structural Games and Number of Quantifiers.

Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

A New Graph Polynomial and Generalized Tutte-Grothendieck Invariant from Quantum Circuits.

Chaowen Guan, Kenneth W. Regan

Proceedings of the Advanced Computing and Systems for Security, 2020

2019

Rating Computer Science via Chess - In Memoriam Daniel Kopec and Hans Berliner.

Kenneth W. Regan

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank.

Chaowen Guan, Kenneth W. Regan

CoRR, 2019

2018

Algebraic and Logical Emulations of Quantum Circuits.

Kenneth W. Regan, Amlan Chakrabarti, Chaowen Guan

Trans. Comput. Sci., 2018

Hilbert's Proof of His Irreducibility Theorem.

Mark B. Villarino, William Gasarch, Kenneth W. Regan

Am. Math. Mon., 2018

Exact Computation of the Number of Accepting Paths of an NTM.

Subrahmanyam Kalyanasundaram, Kenneth W. Regan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2015

Approximation of function evaluation over sequence arguments via specialized data structures.

Tamal T. Biswas, Kenneth W. Regan

Theor. Comput. Sci., 2015

Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data.

Tamal Biswas, Kenneth W. Regan

Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015

Quantifying Depth and Complexity of Thinking and Knowledge.

Tamal T. Biswas, Kenneth W. Regan

Proceedings of the ICAART 2015, 2015

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling.

Guy Haworth, Tamal Biswas, Kenneth W. Regan

Proceedings of the Advances in Computer Games - 14th International Conference, 2015

2014

Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets.

Robert L. Surowka, Kenneth W. Regan

CoRR, 2014

Efficient Memoization for Approximate Function Evaluation over Sequence Arguments.

Tamal Biswas, Kenneth W. Regan

Proceedings of the Algorithmic Aspects in Information and Management, 2014

Human and Computer Preferences at Chess.

Kenneth Wingate Regan, Tamal Biswas, Jason Zhou

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Complexity Theory.

Eric Allender, Michael C. Loui, Kenneth W. Regan

Proceedings of the Computing Handbook, 2014

2013

Psychometric modeling of decision making via game play.

Kenneth W. Regan, Tamal Biswas

Proceedings of the 2013 IEEE Conference on Computational Inteligence in Games (CIG), 2013

People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010.

Richard J. Lipton, Kenneth W. Regan

Springer, ISBN: 978-3-642-41421-3, 2013

2012

Improved simulation of nondeterministic Turing machines.

Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh

Theor. Comput. Sci., 2012

Simulating Special but Natural Quantum Circuits

Richard J. Lipton, Kenneth W. Regan, Atri Rudra

CoRR, 2012

2011

Symmetric Functions Capture General Functions.

Richard J. Lipton, Kenneth W. Regan, Atri Rudra

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Understanding Distributions of Chess Performances.

Kenneth W. Regan, Bartlomiej Macieja, Guy McCrossan Haworth

Proceedings of the Advances in Computer Games - 13th International Conference, 2011

Intrinsic Chess Ratings.

Kenneth Wingate Regan, Guy McCrossan Haworth

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2009

Skill rating by Bayesian inference.

Giuseppe Di Fatta, G. McC. Haworth, Kenneth W. Regan

Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, 2009

Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess.

Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta

Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008

A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle.

Maurice J. Jansen, Kenneth W. Regan

Theor. Comput. Sci., 2008

2007

"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.

Maurice J. Jansen, Kenneth W. Regan

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Improved construction for universality of determinant and permanent.

Hong Liu, Kenneth W. Regan

Inf. Process. Lett., 2006

2004

Games with Uniqueness Properties.

Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe

Theory Comput. Syst., 2004

A Protocol for Serializing Unique Strategies.

Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2002

UPSILON: Universal Programming System with Incomplete Lazy Object Notation.

Brian Postow, Kenneth W. Regan, Carl H. Smith

Fundam. Informaticae, 2002

Understanding the Mulmuley-Sohoni Approach to P vs. NP.

Kenneth W. Regan

Bull. EATCS, 2002

Games with a Uniqueness Property.

Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

1999

Other Complexity Classes and Measures.

Eric Allender, Michael C. Loui, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Reducibility and Completeness.

Eric Allender, Michael C. Loui, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Complexity Classes.

Eric Allender, Michael C. Loui, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Formal Grammars and Languages.

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Computability.

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Parameterized Circuit Complexity and the W Hierarchy.

Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan

Theor. Comput. Sci., 1998

Information capacity of binary weights associative memories.

Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan

Neurocomputing, 1998

A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem

Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar

Electron. Colloquium Comput. Complex., 1998

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).

Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss

Proceedings of the STACS 98, 1998

Probabilistic Martingales and BPTIME Classes.

Kenneth W. Regan, D. Sivakumar

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

Gap-Languages and Log-Time Complexity Classes.

Kenneth W. Regan, Heribert Vollmer

Theor. Comput. Sci., 1997

Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs.

Arun K. Jagota, Kenneth W. Regan

J. Glob. Optim., 1997

Polynomial Vicinity Circuits and Nonlinear Lower Bounds.

Kenneth W. Regan

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Index Sets and Presentations of Complexity Classes.

Kenneth W. Regan

Theor. Comput. Sci., 1996

Linear Time and Memory-Efficient Computation.

Kenneth W. Regan

SIAM J. Comput., 1996

Descriptive complexity and the <i>W</i> hierarchy.

Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1995

On Quasilinear-Time Complexity Theory.

Ashish V. Naik, Kenneth W. Regan, D. Sivakumar

Theor. Comput. Sci., 1995

On Closure Properties of Bounded Two-Sided Error Complexity Classes.

Kenneth W. Regan, James S. Royer

Math. Syst. Theory, 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

Pseudorandom Generators, Measure Theory, and Natural Proofs

Kenneth W. Regan, D. Sivakumar, Jin-yi Cai

Electron. Colloquium Comput. Complex., 1995

Communication Complexity of Key Agreement on Small Ranges.

Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar

Proceedings of the STACS 95, 1995

On Superlinear Lower Bounds in Complexity Theory.

Kenneth W. Regan

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994

The quasilinear isomorphism challenge.

Kenneth W. Regan, Jie Wang

SIGACT News, 1994

A New Parallel Vector Model, with Exact Characterization of NC^k.

Kenneth W. Regan

Proceedings of the STACS 94, 1994

Linear Speed-Up, Information Vicinity, and Finite-State Machines.

Kenneth W. Regan

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Linear-Time Algorithms in Memory Hierarchies.

Kenneth W. Regan

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Machine models and linear time complexity.

Kenneth W. Regan

SIGACT News, 1993

On the Difference Between Turing Machine Time and Random-Access Machine Time.

Kenneth W. Regan

Proceedings of the Computing and Information, 1993

1992

Diagonalization, Uniformity, and Fixed-Point Theorems

Kenneth W. Regan

Inf. Comput., May, 1992

Minimum-Complexity Pairing Functions.

Kenneth W. Regan

J. Comput. Syst. Sci., 1992

1989

Finitary Substructure Languages.

Kenneth W. Regan

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

The Topology of Provability in Complexity Theory.

Kenneth W. Regan

J. Comput. Syst. Sci., 1988

1987

Unprovably intractable languages.

Kenneth W. Regan

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman.

Kenneth W. Regan

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1983

Arithmetical degrees of index sets for complexity classes.

Kenneth W. Regan

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

On Diagonalization Methods and the Structure of Language Classes.

Kenneth W. Regan

Proceedings of the Fundamentals of Computation Theory, 1983