default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth W. Regan
Person information
- affiliation: University at Buffalo, SUNY, Buffalo, NY, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c36]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. LICS 2021: 1-13- [i6]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. CoRR abs/2104.14709 (2021) - 2020
- [c35]Chaowen Guan, Kenneth W. Regan:
A New Graph Polynomial and Generalized Tutte-Grothendieck Invariant from Quantum Circuits. ACSS (1) 2020: 3-16
2010 – 2019
- 2019
- [p7]Kenneth W. Regan:
Rating Computer Science via Chess - In Memoriam Daniel Kopec and Hans Berliner. Computing and Software Science 2019: 200-216 - [i5]Chaowen Guan, Kenneth W. Regan:
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank. CoRR abs/1904.00101 (2019) - 2018
- [j24]Mark B. Villarino, William Gasarch, Kenneth W. Regan:
Hilbert's Proof of His Irreducibility Theorem. Am. Math. Mon. 125(6): 513-530 (2018) - [j23]Kenneth W. Regan
, Amlan Chakrabarti, Chaowen Guan:
Algebraic and Logical Emulations of Quantum Circuits. Trans. Comput. Sci. 31: 41-76 (2018) - [c34]Subrahmanyam Kalyanasundaram, Kenneth W. Regan:
Exact Computation of the Number of Accepting Paths of an NTM. CALDAM 2018: 105-117 - 2015
- [j22]Tamal T. Biswas, Kenneth W. Regan:
Approximation of function evaluation over sequence arguments via specialized data structures. Theor. Comput. Sci. 607: 113-123 (2015) - [c33]Guy Haworth, Tamal Biswas, Kenneth W. Regan:
A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. ACG 2015: 135-146 - [c32]Tamal T. Biswas, Kenneth W. Regan:
Quantifying Depth and Complexity of Thinking and Knowledge. ICAART (2) 2015: 602-607 - [c31]Tamal Biswas, Kenneth W. Regan:
Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. ICMLA 2015: 941-947 - 2014
- [c30]Kenneth Wingate Regan, Tamal Biswas, Jason Zhou:
Human and Computer Preferences at Chess. MPREF@AAAI 2014 - [c29]Tamal Biswas, Kenneth W. Regan:
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. AAIM 2014: 185-196 - [p6]Eric Allender, Michael C. Loui, Kenneth W. Regan:
Complexity Theory. Computing Handbook, 3rd ed. (1) 2014: 7: 1-33 - [i4]Robert L. Surowka, Kenneth W. Regan:
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets. CoRR abs/1404.4852 (2014) - 2013
- [b1]Richard J. Lipton, Kenneth W. Regan:
People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010. Springer 2013, ISBN 978-3-642-41421-3, pp. I-XVIII, 1-333 - [c28]Kenneth W. Regan, Tamal Biswas:
Psychometric modeling of decision making via game play. CIG 2013: 1-8 - 2012
- [j21]Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh:
Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. 417: 66-73 (2012) - [i3]Richard J. Lipton, Kenneth W. Regan, Atri Rudra:
Simulating Special but Natural Quantum Circuits. CoRR abs/1201.3306 (2012) - 2011
- [c27]Kenneth Wingate Regan, Guy McCrossan Haworth:
Intrinsic Chess Ratings. AAAI 2011: 834-839 - [c26]Kenneth W. Regan, Bartlomiej Macieja, Guy McCrossan Haworth:
Understanding Distributions of Chess Performances. ACG 2011: 230-243 - [c25]Richard J. Lipton, Kenneth W. Regan, Atri Rudra:
Symmetric Functions Capture General Functions. MFCS 2011: 436-447 - 2010
- [c24]Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh:
Improved Simulation of Nondeterministic Turing Machines. MFCS 2010: 453-464
2000 – 2009
- 2009
- [c23]Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta:
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. ACG 2009: 99-110 - [c22]Giuseppe Di Fatta, G. McC. Haworth, Kenneth W. Regan:
Skill rating by Bayesian inference. CIDM 2009: 89-94 - 2008
- [j20]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): 617-622 (2008) - 2007
- [c21]Maurice J. Jansen, Kenneth W. Regan:
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. COCOON 2007: 470-481 - 2006
- [j19]Hong Liu, Kenneth W. Regan:
Improved construction for universality of determinant and permanent. Inf. Process. Lett. 100(6): 233-237 (2006) - 2004
- [j18]Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe:
Games with Uniqueness Properties. Theory Comput. Syst. 37(1): 29-47 (2004) - [c20]Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta:
A Protocol for Serializing Unique Strategies. MFCS 2004: 660-672 - 2002
- [j17]Kenneth W. Regan:
Understanding the Mulmuley-Sohoni Approach to P vs. NP. Bull. EATCS 78: 86-99 (2002) - [j16]Brian Postow, Kenneth W. Regan, Carl H. Smith:
UPSILON: Universal Programming System with Incomplete Lazy Object Notation. Fundam. Informaticae 50(3-4): 325-359 (2002) - [c19]Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe:
Games with a Uniqueness Property. STACS 2002: 396-407 - 2000
- [j15]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): 576-601 (2000)
1990 – 1999
- 1999
- [p5]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Computability. Algorithms and Theory of Computation Handbook 1999 - [p4]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Formal Grammars and Languages. Algorithms and Theory of Computation Handbook 1999 - [p3]Eric Allender, Michael C. Loui, Kenneth W. Regan:
Complexity Classes. Algorithms and Theory of Computation Handbook 1999 - [p2]Eric Allender, Michael C. Loui, Kenneth W. Regan:
Reducibility and Completeness. Algorithms and Theory of Computation Handbook 1999 - [p1]Eric Allender, Michael C. Loui, Kenneth W. Regan:
Other Complexity Classes and Measures. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j14]Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan:
Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998) - [j13]Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan:
Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998) - [c18]Kenneth W. Regan, D. Sivakumar:
Probabilistic Martingales and BPTIME Classes. CCC 1998: 186- - [c17]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: 161-171 - [i2]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. TR98 (1998) - 1997
- [j12]Arun K. Jagota, Kenneth W. Regan:
Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs. J. Glob. Optim. 10(4): 439-465 (1997) - [j11]Kenneth W. Regan, Heribert Vollmer:
Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997) - [c16]Kenneth W. Regan:
Polynomial Vicinity Circuits and Nonlinear Lower Bounds. CCC 1997: 61-68 - 1996
- [j10]Kenneth W. Regan:
Linear Time and Memory-Efficient Computation. SIAM J. Comput. 25(1): 133-168 (1996) - [j9]Kenneth W. Regan:
Index Sets and Presentations of Complexity Classes. Theor. Comput. Sci. 161(1&2): 263-287 (1996) - [c15]Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan:
Descriptive complexity and the W hierarchy. Proof Complexity and Feasible Arithmetics 1996: 119-134 - 1995
- [j8]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): 456-467 (1995) - [j7]Kenneth W. Regan, James S. Royer:
On Closure Properties of Bounded Two-Sided Error Complexity Classes. Math. Syst. Theory 28(3): 229-243 (1995) - [j6]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995) - [c14]Kenneth W. Regan:
On Superlinear Lower Bounds in Complexity Theory. SCT 1995: 50-64 - [c13]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995: 26-35 - [c12]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: 38-49 - [i1]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j5]Kenneth W. Regan, Jie Wang:
The quasilinear isomorphism challenge. SIGACT News 25(3): 106-113 (1994) - [c11]Kenneth W. Regan:
Linear-Time Algorithms in Memory Hierarchies. IFIP Congress (1) 1994: 288-293 - [c10]Kenneth W. Regan:
Linear Speed-Up, Information Vicinity, and Finite-State Machines. IFIP Congress (1) 1994: 609-614 - [c9]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
Quasilinear Time Complexity Theory. STACS 1994: 97-108 - [c8]Kenneth W. Regan:
A New Parallel Vector Model, with Exact Characterization of NC^k. STACS 1994: 289-300 - 1993
- [j4]Kenneth W. Regan:
Machine models and linear time complexity. SIGACT News 24(3): 5-15 (1993) - [c7]Kenneth W. Regan:
On the Difference Between Turing Machine Time and Random-Access Machine Time. ICCI 1993: 36-40 - 1992
- [j3]Kenneth W. Regan:
Diagonalization, Uniformity, and Fixed-Point Theorems. Inf. Comput. 98(1): 1-40 (1992) - [j2]Kenneth W. Regan:
Minimum-Complexity Pairing Functions. J. Comput. Syst. Sci. 45(3): 285-295 (1992)
1980 – 1989
- 1989
- [c6]Kenneth W. Regan:
Finitary Substructure Languages. SCT 1989: 87-96 - 1988
- [j1]Kenneth W. Regan:
The Topology of Provability in Complexity Theory. J. Comput. Syst. Sci. 36(3): 384-432 (1988) - 1987
- [c5]Kenneth W. Regan:
Unprovably intractable languages. SCT 1987: 69-80 - 1986
- [c4]Kenneth W. Regan:
The Topology of Provability in Complexity Theory. SCT 1986: 291-310 - [c3]Kenneth W. Regan:
A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. ICALP 1986: 324-333 - 1983
- [c2]Kenneth W. Regan:
On Diagonalization Methods and the Structure of Language Classes. FCT 1983: 368-380 - [c1]Kenneth W. Regan:
Arithmetical degrees of index sets for complexity classes. Logic and Machines 1983: 118-130
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
