Kenneth W. Regan

Publication Activity (10 Years)

Years Active: 1983-2021
Publications (10 Years): 7

Top Topics

Exact Computation

Skill Assessment

Quantum Mechanics

Top Venues

Theor. Comput. Sci.

Publications

Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas
Multi-Structural Games and Number of Quantifiers. LICS (2021)
Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas
Multi-Structural Games and Number of Quantifiers. CoRR (2021)
Chaowen Guan, Kenneth W. Regan
A New Graph Polynomial and Generalized Tutte-Grothendieck Invariant from Quantum Circuits. ACSS (1) (2020)
Chaowen Guan, Kenneth W. Regan
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank. CoRR (2019)
Kenneth W. Regan, Amlan Chakrabarti, Chaowen Guan
Algebraic and Logical Emulations of Quantum Circuits. Trans. Comput. Sci. 31 (2018)
Mark B. Villarino, William Gasarch, Kenneth W. Regan
Hilbert's Proof of His Irreducibility Theorem. Am. Math. Mon. 125 (6) (2018)
Subrahmanyam Kalyanasundaram, Kenneth W. Regan
Exact Computation of the Number of Accepting Paths of an NTM. CALDAM (2018)
Tamal T. Biswas, Kenneth W. Regan
Approximation of function evaluation over sequence arguments via specialized data structures. Theor. Comput. Sci. 607 (2015)
Guy Haworth, Tamal Biswas, Kenneth W. Regan
A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. ACG (2015)
Tamal Biswas, Kenneth W. Regan
Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. ICMLA (2015)
Tamal T. Biswas, Kenneth W. Regan
Quantifying Depth and Complexity of Thinking and Knowledge. ICAART (2) (2015)
Robert L. Surowka, Kenneth W. Regan
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets. CoRR (2014)
Tamal Biswas, Kenneth W. Regan
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. AAIM (2014)
Kenneth W. Regan, Tamal Biswas
Psychometric modeling of decision making via game play. CIG (2013)
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. 417 (2012)
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
Simulating Special but Natural Quantum Circuits CoRR (2012)
Kenneth W. Regan, Bartlomiej Macieja, Guy McCrossan Haworth
Understanding Distributions of Chess Performances. ACG (2011)
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
Symmetric Functions Capture General Functions. MFCS (2011)
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
Improved Simulation of Nondeterministic Turing Machines. MFCS (2010)
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. ACG (2009)
Giuseppe Di Fatta, G. McC. Haworth, Kenneth W. Regan
Skill rating by Bayesian inference. CIDM (2009)
Maurice J. Jansen, Kenneth W. Regan
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. Theor. Comput. Sci. 409 (3) (2008)
Maurice J. Jansen, Kenneth W. Regan
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. COCOON (2007)
Hong Liu, Kenneth W. Regan
Improved construction for universality of determinant and permanent. Inf. Process. Lett. 100 (6) (2006)
Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
A Protocol for Serializing Unique Strategies. MFCS (2004)
Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
Games with Uniqueness Properties. Theory Comput. Syst. 37 (1) (2004)
Brian Postow, Kenneth W. Regan, Carl H. Smith
UPSILON: Universal Programming System with Incomplete Lazy Object Notation. Fundam. Informaticae 50 (3-4) (2002)
Kenneth W. Regan
Understanding the Mulmuley-Sohoni Approach to P vs. NP. Bull. EATCS 78 (2002)
Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
Games with a Uniqueness Property. STACS (2002)
Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30 (2) (2000)
Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan
Information capacity of binary weights associative memories. Neurocomputing 19 (1-3) (1998)
Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem Electron. Colloquium Comput. Complex. 5 (58) (1998)
Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS (1998)
Kenneth W. Regan, D. Sivakumar
Probabilistic Martingales and BPTIME Classes. Computational Complexity Conference (1998)
Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191 (1-2) (1998)
Kenneth W. Regan
Polynomial Vicinity Circuits and Nonlinear Lower Bounds. Computational Complexity Conference (1997)
Arun K. Jagota, Kenneth W. Regan
Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs. J. Glob. Optim. 10 (4) (1997)
Kenneth W. Regan, Heribert Vollmer
Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188 (1-2) (1997)
Kenneth W. Regan
Linear Time and Memory-Efficient Computation. SIAM J. Comput. 25 (1) (1996)
Kenneth W. Regan
Index Sets and Presentations of Complexity Classes. Theor. Comput. Sci. 161 (1&2) (1996)
Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
hierarchy. Proof Complexity and Feasible Arithmetics (1996)
Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
Pseudorandom Generators, Measure Theory, and Natural Proofs Electron. Colloquium Comput. Complex. 2 (6) (1995)
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148 (2) (1995)
Kenneth W. Regan
On Superlinear Lower Bounds in Complexity Theory. Computational Complexity Conference (1995)
Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
Communication Complexity of Key Agreement on Small Ranges. STACS (1995)
Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50 (3) (1995)
Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS (1995)
Kenneth W. Regan, James S. Royer
On Closure Properties of Bounded Two-Sided Error Complexity Classes. Math. Syst. Theory 28 (3) (1995)
Kenneth W. Regan, Jie Wang
The quasilinear isomorphism challenge. SIGACT News 25 (3) (1994)
Kenneth W. Regan
Linear-Time Algorithms in Memory Hierarchies. IFIP Congress (1) (1994)
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
Quasilinear Time Complexity Theory. STACS (1994)
Kenneth W. Regan
A New Parallel Vector Model, with Exact Characterization of NC^k. STACS (1994)
Kenneth W. Regan
Linear Speed-Up, Information Vicinity, and Finite-State Machines. IFIP Congress (1) (1994)
Kenneth W. Regan
Machine models and linear time complexity. SIGACT News 24 (3) (1993)
Kenneth W. Regan
On the Difference Between Turing Machine Time and Random-Access Machine Time. ICCI (1993)
Kenneth W. Regan
Minimum-Complexity Pairing Functions. J. Comput. Syst. Sci. 45 (3) (1992)
Kenneth W. Regan
Diagonalization, Uniformity, and Fixed-Point Theorems Inf. Comput. 98 (1) (1992)
Kenneth W. Regan
Finitary Substructure Languages. Computational Complexity Conference (1989)
Kenneth W. Regan
The Topology of Provability in Complexity Theory. J. Comput. Syst. Sci. 36 (3) (1988)
Kenneth W. Regan
Unprovably intractable languages. Computational Complexity Conference (1987)
Kenneth W. Regan
The Topology of Provability in Complexity Theory. Computational Complexity Conference (1986)
Kenneth W. Regan
A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. ICALP (1986)
Kenneth W. Regan
On Diagonalization Methods and the Structure of Language Classes. FCT (1983)
Kenneth W. Regan
Arithmetical degrees of index sets for complexity classes. Logic and Machines (1983)