Difference between revisions of "Kenneth W. Regan"

From Chessprogramming wiki
Jump to: navigation, search
Line 4: Line 4:
  
 
'''Kenneth W. Regan''' (Ken Regan),<br/>
 
'''Kenneth W. Regan''' (Ken Regan),<br/>
an American 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 works in [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory] and other fields of [https://en.wikipedia.org/wiki/Information_theory information theory] and [https://en.wikipedia.org/wiki/Pure_mathematics pure mathematics], and further 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> .  
+
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 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=  
 
=Selected Publications=  
Line 50: Line 50:
 
* [https://engineering.buffalo.edu/computer-science-engineering/people/faculty-directory/ken-regan.html Kenneth W. Regan - UB Computer Science and Engineering]
 
* [https://engineering.buffalo.edu/computer-science-engineering/people/faculty-directory/ken-regan.html Kenneth W. Regan - UB Computer Science and Engineering]
 
* [https://rjlipton.wordpress.com/ Gödel's Lost Letter and P=NP] by [[Mathematician#RJLipton|Dick Lipton]] and [[Kenneth W. Regan|Ken Regan]]
 
* [https://rjlipton.wordpress.com/ Gödel's Lost Letter and P=NP] by [[Mathematician#RJLipton|Dick Lipton]] and [[Kenneth W. Regan|Ken Regan]]
 +
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=172360 Kenneth Regan - The Mathematics Genealogy Project]
 
* [https://ratings.fide.com/card.phtml?event=2000725 Regan, Kenneth FIDE Chess Profile]
 
* [https://ratings.fide.com/card.phtml?event=2000725 Regan, Kenneth FIDE Chess Profile]
 
* [http://www.chessgames.com/player/kenneth_regan.html The chess games of Kenneth Regan] from [http://www.chessgames.com/index.html chessgames.com]
 
* [http://www.chessgames.com/player/kenneth_regan.html The chess games of Kenneth Regan] from [http://www.chessgames.com/index.html chessgames.com]
 
* [http://buffalochess.blogspot.com/2010/06/kenneth-w-regan-international-master-is.html Buffalo Niagara Chess Corner: Kenneth W. Regan, International Master is 2010 Mayor's Cup Masters Champion]
 
* [http://buffalochess.blogspot.com/2010/06/kenneth-w-regan-international-master-is.html Buffalo Niagara Chess Corner: Kenneth W. Regan, International Master is 2010 Mayor's Cup Masters Champion]
 
* [http://buffalochess.blogspot.com/2010/09/undefeated-kenneth-w-regan-phd-wins.html Buffalo Niagara Chess Corner: UNDEFEATED KENNETH W. REGAN, Ph.D, WINS!]
 
* [http://buffalochess.blogspot.com/2010/09/undefeated-kenneth-w-regan-phd-wins.html Buffalo Niagara Chess Corner: UNDEFEATED KENNETH W. REGAN, Ph.D, WINS!]
 +
* [http://www.uschess.org/content/view/12677/763/ The United States Chess Federation - How To Catch A Chess Cheater: Ken Regan Finds Moves Out Of Mind] by [https://www.linkedin.com/in/howard-goldowsky-11b321123/ Howard Goldowsky], June 1, 2014
  
 
=References=  
 
=References=  
Line 59: Line 61:
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 
[[Category:Chess Player|Regan]]
 
[[Category:Chess Player|Regan]]
[[Category:Researcher|Regan]]
+
[[Category:Mathematician|Regan]]

Revision as of 14:33, 12 November 2018

Home * People * Kenneth W. Regan

Kenneth W. Regan [1]

Kenneth W. Regan (Ken Regan),
an American chess player, mathematician, computer scientist and associate professor with tenure at Department Computer Science and Engineering [2], University at Buffalo, Amherst, New York. He defended his Ph.D. On the separation of complexity classes in 1986 at University of Oxford under Dominic Welsh. Beside computational complexity theory, his research interests includes other fields of information theory and pure mathematics. Kenneth W. Regan holds the title of a Chess International Master [3] with a rating of 2372 [4].

Selected Publications

[5] [6]

1999

2000 ...

2010 ...

2015 ...

Forum & Blog Posts

2008

2010 ...

2015 ...

External Links

Measuring Fidelity to a Computer Agent
Kenneth W. Regan's Chess Page
Kasparov Versus the World: The Great Internet Match [18]
Computer Chess - Hash Collisions in Chess Engines, and What They May Mean... by Kenneth W. Regan » Transposition Table

References

Up one level