Kenneth W. Regan

74 papers A* 3A 7B 4C 4Misc 1Journal 32Unranked 15

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