Faculty

Institution

Unit

Venue

Kenneth W. Regan

Professor

University at Buffalo

Affiliations

School of Engineering and Applied Sciences

Department of Computer Science and Engineering

Kenneth W. Regan is currently serving as a Computer Science And Engineering Professor at University At Buffalo.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Kenneth W. Regan

University at Buffalo

Professor

You can click a keyword to filter the displayed items

computer science applied mathematics theoretical computer science machine learning theory of computation graph theory computational complexity computational complexity theory computability theory behavioral sciences decision science algorithmic information theory data science decision theory complexity theory decision analysis complexity classes probability theory combinatorics logic in computer science combinatorial theory mathematical optimization human decision process computational game theory circuit complexity resource-bounded measure index sets combinatorial optimization mathematical programming discrete algorithms numerical algorithms human-computer interaction behavioral decision making automated reasoning knowledge discovery information technology spectral theory scientific computing measure theory bayesian inference p versus np problem enumerative combinatorics combinatorial methods combinatory analysis combinatorial problems performance analysis optimization problems human error synchronization protocol serialization language abstract interpretation algebraic semantics algebraic combinatorics temporal complexity time complexity theoretical issues mathematical proof proof system psychometrics cognitive analysis complexity science human cognition sequential decision making pseudorandom generators natural proofs skill rating formal grammars quasilinear-time complexity theory log-time complexity classes combinatorial optimization meetings intrinsic chess ratings diagonalization methods language classes understanding distributions chess performances fallible choice automated deduction logic programming computational logic mathematical logic

Notable Scholarly Works

Notable Federal Grants

Collaborators

A New Graph Polynomial and Generalized Tutte–Grothendieck Invariant From Quantum Circuits. Advances in intelligent systems and computing (2020)

Chaowen GuanKenneth W. Regan

quantum circuitsgraph theoryartificial intelligencetutte-grothendieck invariantintelligent systemscomputer science

Computability. Princeton University Press eBooks (2019)

John Stillwell

Rating Computer Science via Chess. Lecture notes in computer science (2019)

Kenneth W. Regan

rating computer scienceranking algorithmscomputer science

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank. arXiv (Cornell University) (2019)

Chaowen GuanKenneth W. Regan

graph theorycomputer sciencestabilizer circuitsquadratic forms

Algebraic and Logical Emulations of Quantum Circuits. Lecture notes in computer science (2018)

Kenneth ReganAmlan ChakrabartiChaowen Guan

theoretical computer sciencecomputer sciencelogical emulations

Exact Computation of the Number of Accepting Paths of an Ntm. Lecture notes in computer science (2018)

Subrahmanyam KalyanasundaramKenneth W. Regan

exact computationtheoretical computer sciencecomputer sciencemachine learning

Hilbert’s Proof of His Irreducibility Theorem. American Mathematical Monthly (2018)

Mark B. VillarinoWilliam GasarchKenneth W. Regan

irreducibility theoremgraph theorymathematicsmathematical logic

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Lecture notes in computer science (2015)

Guy HaworthTamal BiswasKen Regan

computer sciencemachine learningskill assessmentcomparative review

Approximation of Function Evaluation Over Sequence Arguments via Specialized Data Structures. Theoretical Computer Science (2015)

Tamal T. BiswasKenneth W. Regan

function evaluationtheory of computationtheoretical computer scienceapproximation theoryspecialized data structuressequence argumentscomputability theorycomputer science

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

Tamal BiswasKenneth Regan

decision analysislevel-k reasoningdecision sciencecognitive sciencegame-play datamachine learninghuman errorbehavioral sciences

1
2
3
4
5
8
10 / page

Kenneth W. Regan

Professor

University at Buffalo

Affiliations

School of Engineering and Applied Sciences

Department of Computer Science and Engineering

Kenneth W. Regan is currently serving as a Computer Science And Engineering Professor at University At Buffalo.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Kenneth W. Regan

University at Buffalo

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A New Graph Polynomial and Generalized Tutte–Grothendieck Invariant From Quantum Circuits. Advances in intelligent systems and computing (2020)

Chaowen GuanKenneth W. Regan

quantum circuitsgraph theoryartificial intelligencetutte-grothendieck invariantintelligent systemscomputer science

Computability. Princeton University Press eBooks (2019)

John Stillwell

Rating Computer Science via Chess. Lecture notes in computer science (2019)

Kenneth W. Regan

rating computer scienceranking algorithmscomputer science

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank. arXiv (Cornell University) (2019)

Chaowen GuanKenneth W. Regan

graph theorycomputer sciencestabilizer circuitsquadratic forms

Algebraic and Logical Emulations of Quantum Circuits. Lecture notes in computer science (2018)

Kenneth ReganAmlan ChakrabartiChaowen Guan

theoretical computer sciencecomputer sciencelogical emulations

Exact Computation of the Number of Accepting Paths of an Ntm. Lecture notes in computer science (2018)

Subrahmanyam KalyanasundaramKenneth W. Regan

exact computationtheoretical computer sciencecomputer sciencemachine learning

Hilbert’s Proof of His Irreducibility Theorem. American Mathematical Monthly (2018)

Mark B. VillarinoWilliam GasarchKenneth W. Regan

irreducibility theoremgraph theorymathematicsmathematical logic

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Lecture notes in computer science (2015)

Guy HaworthTamal BiswasKen Regan

computer sciencemachine learningskill assessmentcomparative review

Approximation of Function Evaluation Over Sequence Arguments via Specialized Data Structures. Theoretical Computer Science (2015)

Tamal T. BiswasKenneth W. Regan

function evaluationtheory of computationtheoretical computer scienceapproximation theoryspecialized data structuressequence argumentscomputability theorycomputer science

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

Tamal BiswasKenneth Regan

decision analysislevel-k reasoningdecision sciencecognitive sciencegame-play datamachine learninghuman errorbehavioral sciences

1
2
3
4
5
8
10 / page

Similar Faculty Members

Ker-I Ko

Institution

Stony Brook University

computational complexity

computational complexity theory

Samuel R. Buss

Institution

University of California, San Diego

mathematical logic

logic in computer science

Kfoury

Institution

Boston University

logic programming

mathematical logic

Daniel Leivant

Institution

Indiana University Bloomington

programming language theory

programming language

Valentina S. Harizanov

Institution

George Washington University

computable model theory

mathematical logic

William Gasarch

Institution

University of Maryland, College Park

discrete algorithm

extremal graph theory

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Damir Dzhafarov

Institution

University of Connecticut

mathematics

mathematics education

Jack Lutz

Institution

Iowa State University

quantum biology

computational complexity

Salil Vadhan

Institution

Harvard University

discrete algorithm

computational complexity

Similar Faculty Members

Ker-I Ko

Institution

Stony Brook University

computational complexity

computational complexity theory

Samuel R. Buss

Institution

University of California, San Diego

mathematical logic

logic in computer science

Kfoury

Institution

Boston University

logic programming

mathematical logic

Daniel Leivant

Institution

Indiana University Bloomington

programming language theory

programming language

Valentina S. Harizanov

Institution

George Washington University

computable model theory

mathematical logic

William Gasarch

Institution

University of Maryland, College Park

discrete algorithm

extremal graph theory

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Damir Dzhafarov

Institution

University of Connecticut

mathematics

mathematics education

Jack Lutz

Institution

Iowa State University

quantum biology

computational complexity

Salil Vadhan

Institution

Harvard University

discrete algorithm

computational complexity