25,161
edits
Changes
no edit summary
'''Kenneth W. Regan''' (Ken Regan),<br/>
an American chess player, mathematician, computer scientist and associate professor with tenure at ''Department Computer Science and Engineering'' <ref>[http://www.cse.buffalo.edu/ UB Computer Science and Engineering]</ref>, [https://en.wikipedia.org/wiki/University_at_Buffalo University at Buffalo], [https://en.wikipedia.org/wiki/Amherst,_New_York Amherst, New York]. He defended his Ph.D. On on the [https://en.wikipedia.org/wiki/List_of_complexity_classes separation ] of [https://en.wikipedia.org/wiki/Complexity_class complexity classes] in 1986 at [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford] under [[Mathematician#DWelsh|Dominic Welsh]]. Beside [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory], his research interests includes other fields of [https://en.wikipedia.org/wiki/Information_theory information theory] and [https://en.wikipedia.org/wiki/Pure_mathematics pure mathematics]. Kenneth W. Regan holds the title of a [https://en.wikipedia.org/wiki/FIDE_titles#International_Master_.28IM.29 Chess International Master] <ref>[https://cse.buffalo.edu/faculty/regan/chess/fidelity/ Measuring Fidelity to a Computer Agent]</ref> with a rating of 2372 <ref>[https://ratings.fide.com/card.phtml?event=2000725 Regan, Kenneth FIDE Chess Profile]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/r/Regan:Kenneth_W= dblp: Kenneth W. Regan]</ref> <ref>[https://cse.buffalo.edu/faculty/regan/publications.html Kenneth W. Regan - Selected Publications]</ref>
==19991980 ...==* [[Kenneth W. Regan]] ('''1983'''). ''Arithmetical degrees of index sets for complexity classes''. [https://dblp.uni-trier.de/db/conf/lam/lam1983.html Logic and Machines]* [[Kenneth W. Regan]] ('''1986'''). ''On the separation of complexity classes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford], advisor [[Mathematician#DWelsh|Dominic Welsh]]==1990 ...==* [[Kenneth W. Regan]] ('''1992'''). ''Minimum-Complexity Pairing Functions''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 45, No. 3* [[Kenneth W. Regan]] ('''1993'''). ''[https://ieeexplore.ieee.org/document/315406 On the Difference Between Turing Machine Time and Random-Access Machine Time]''. [https://dblp.uni-trier.de/db/conf/icci/icci1993.html ICCI 93]
* [https://en.wikipedia.org/wiki/Irina_Krush Irina Krush], [[Kenneth W. Regan]] ('''1999'''). ''[http://www.cse.buffalo.edu/~regan/chess/K-W/KHR99i.html The Greatest Game in the History of Chess]''. A Special Report by Irina Krush, Official MSN Game Analyst, [http://www.cse.buffalo.edu/~regan/chess/K-W/KHR99ii.html part 2], [http://www.cse.buffalo.edu/~regan/chess/K-W/Q-ending.html part 3] with [http://www.chessgames.com/perl/chessplayer?pid=123710 Paul Hodges] <ref>Analyzing [https://en.wikipedia.org/wiki/Kasparov_versus_the_World Kasparov versus the World] using the [[Endgame Tablebases|EGTBs]] by [[Peter Karrer]]</ref> <ref>[[Peter Karrer]] ('''2000'''). ''KQQKQP and KQPKQP≈''. [[ICGA Journal#23_2|ICGA Journal, Vol. 23, No. 2]]</ref>
==2000 ...==
