☰

Kenneth W. Regan - Publications

Affiliations: 
State University of New York, Buffalo, Buffalo, NY, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

16 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Villarino MB, Gasarch W, Regan KW. Hilbert’s Proof of His Irreducibility Theorem American Mathematical Monthly. 125: 513-530. DOI: 10.1080/00029890.2018.1448181  0.323
2015 Biswas TT, Regan KW. Approximation of function evaluation over sequence arguments via specialized data structures Theoretical Computer Science. 607: 113-123. DOI: 10.1016/J.Tcs.2015.03.049  0.325
2012 Kalyanasundaram S, Lipton RJ, Regan KW, Shokrieh F. Improved simulation of nondeterministic Turing machines Theoretical Computer Science. 417: 66-73. DOI: 10.1016/J.Tcs.2011.05.018  0.345
2008 Jansen MJ, Regan KW. A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle Theoretical Computer Science. 409: 617-622. DOI: 10.1016/J.Tcs.2008.09.029  0.555
2007 Jansen MJ, Regan KW. "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.  0.537
2006 Liu H, Regan KW. Improved construction for universality of determinant and permanent Information Processing Letters. 100: 233-237. DOI: 10.1016/J.Ipl.2006.05.017  0.343
2000 Buhrman H, Van Melkebeer D, Regan KW, Sivakumar D, Strauss M. A generalization of resource-bounded measure, with application to the BPP VS. EXP problem Siam Journal On Computing. 30: 576-601. DOI: 10.1137/S0097539798343891  0.38
1997 Regan KW, Vollmer H. Gap-languages and log-time complexity classes Theoretical Computer Science. 188: 101-116. DOI: 10.1016/S0304-3975(96)00288-5  0.346
1996 Regan KW. Linear time and memory-efficient computation Siam Journal On Computing. 25: 133-168. DOI: 10.1137/S0097539793251888  0.338
1996 Regan KW. Index sets and presentations of complexity classes Theoretical Computer Science. 161: 263-287. DOI: 10.1016/0304-3975(95)00146-8  0.36
1995 Regan KW, Royer JS. On closure properties of bounded two-sided error complexity classes Mathematical Systems Theory. 28: 229-243. DOI: 10.1007/Bf01303057  0.35
1995 Green F, Kobler J, Regan KW, Schwentick T, Toran J. The Power of the Middle Bit of a #P Function Journal of Computer and System Sciences. 50: 456-467. DOI: 10.1006/Jcss.1995.1036  0.405
1994 Regan KW, Wang J. The quasilinear isomorphism challenge Sigact News. 25: 106-113. DOI: 10.1145/193820.193839  0.37
1993 Regan KW. Machine models and linear time complexity Sigact News. 24: 5-15. DOI: 10.1145/166589.166591  0.386
1992 Regan KW. Diagonalization, uniformity, and fixed-point theorems Information and Computation. 98: 1-40. DOI: 10.1016/0890-5401(92)90040-M  0.397
1992 Regan KW. Minimum-complexity pairing functions Journal of Computer and System Sciences. 45: 285-295. DOI: 10.1016/0022-0000(92)90027-G  0.387
Show low-probability matches.