☰

Kenneth W. Regan

Affiliations: 
State University of New York, Buffalo, Buffalo, NY, United States 
Area:
Computer Science
Google:
"Kenneth Regan"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
Maurice J. Jansen grad student 2006 SUNY Buffalo
Qi Duan grad student 2008 SUNY Buffalo
Robert Surowka grad student 2014 SUNY Buffalo

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Villarino MB, Gasarch W, Regan KW. (2018) Hilbert’s Proof of His Irreducibility Theorem American Mathematical Monthly. 125: 513-530
Biswas TT, Regan KW. (2015) Approximation of function evaluation over sequence arguments via specialized data structures Theoretical Computer Science. 607: 113-123
Kalyanasundaram S, Lipton RJ, Regan KW, et al. (2012) Improved simulation of nondeterministic Turing machines Theoretical Computer Science. 417: 66-73
Jansen MJ, Regan KW. (2008) A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle Theoretical Computer Science. 409: 617-622
Jansen MJ, Regan KW. (2007) "Resistant" polynomials and stronger lower bounds for depth-three arithmetical formulas Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4598: 470-481
Liu H, Regan KW. (2006) Improved construction for universality of determinant and permanent Information Processing Letters. 100: 233-237
Buhrman H, Van Melkebeer D, Regan KW, et al. (2000) A generalization of resource-bounded measure, with application to the BPP VS. EXP problem Siam Journal On Computing. 30: 576-601
Regan KW, Vollmer H. (1997) Gap-languages and log-time complexity classes Theoretical Computer Science. 188: 101-116
Regan KW. (1996) Linear time and memory-efficient computation Siam Journal On Computing. 25: 133-168
Regan KW. (1996) Index sets and presentations of complexity classes Theoretical Computer Science. 161: 263-287
See more...