Changes

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 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 include 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>.