Difference between revisions of "Kenneth W. Regan"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 4: | Line 4: | ||
'''Kenneth W. Regan''' (Ken Regan),<br/> | '''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. | + | 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 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= | ||
<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> | <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> | ||
| − | == | + | ==1980 ...== |
| + | * [[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> | * [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 ...== | ==2000 ...== | ||
Revision as of 15:47, 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].
Contents
Selected Publications
1980 ...
- Kenneth W. Regan (1983). Arithmetical degrees of index sets for complexity classes. Logic and Machines
- Kenneth W. Regan (1986). On the separation of complexity classes. Ph.D. thesis, University of Oxford, advisor Dominic Welsh
1990 ...
- Kenneth W. Regan (1992). Minimum-Complexity Pairing Functions. Journal of Computer and System Sciences, Vol. 45, No. 3
- Kenneth W. Regan (1993). On the Difference Between Turing Machine Time and Random-Access Machine Time. ICCI 93
- Irina Krush, Kenneth W. Regan (1999). The Greatest Game in the History of Chess. A Special Report by Irina Krush, Official MSN Game Analyst, part 2, part 3 with Paul Hodges [7] [8]
2000 ...
- Denis Xavier Charles, Kenneth W. Regan (2004). On arithmetical formulas whose Jacobians are Groebner Bases. Journal of Symbolic Logic, pdf [9] [10]
- Giuseppe Di Fatta, Guy Haworth, Kenneth W. Regan (2009). Skill Rating by Bayesian Inference. CIDM 2009, pdf [11]
2010 ...
- Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta (2010). Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. Advances in Computer Games 12, pdf
- Kenneth W. Regan, Guy Haworth (2011). Intrinsic Chess Ratings. AAAI 2011, pdf, slides as pdf [12]
- Kenneth W. Regan, Bartłomiej Macieja, Guy Haworth (2011). Understanding Distributions of Chess Performances. Advances in Computer Games 13, pdf
- Kenneth W. Regan, Tamal T. Biswas (2013). Psychometric modeling of decision making via game play. CIG 2013, slides as pdf
- Kenneth W. Regan, Tamal T. Biswas, Jason Zhou (2014). Human and Computer Preferences at Chess. pdf
2015 ...
- Tamal T. Biswas, Kenneth W. Regan (2015). Quantifying Depth and Complexity of Thinking and Knowledge. ICAART 2015, pdf
- Guy Haworth, Tamal T. Biswas, Kenneth W. Regan (2015). A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Advances in Computer Games 14
- Tamal T. Biswas, Kenneth W. Regan (2015). Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. IEEE ICMLA 2015, pdf preprint
Forum & Blog Posts
2008
- Computational Complexity: Bobby Fischer (Guest Post by Ken Regan), January 18, 2008
2010 ...
- Poker and Cantor’s Proof by Ken Regan, Gödel’s Lost Letter and P=NP, October 29, 2011
- A Neat Result About The Simplex Algorithm by Ken Regan, Gödel’s Lost Letter and P=NP, November 22, 2011
- The Higgs Confidence Game by Ken Regan, Gödel’s Lost Letter and P=NP, December 13, 2011
- Predictions For 2012 by Ken Regan, Gödel’s Lost Letter and P=NP, January 3, 2012
- The New Chess World Champion by Ken Regan, Gödel's Lost Letter and P=NP, December 28, 2014 » Larry Kaufman, TCEC Season 7, Komodo [13]
2015 ...
- Depth of Satisficing by Ken Regan, Gödel's Lost Letter and P=NP, October 06, 2015 » Depth, Match Statistics, Pawn Advantage, Win Percentage, and Elo, Stockfish, Komodo [14]
- Thanks for Additivity by Ken Regan, Gödel's Lost Letter and P=NP, November 27, 2015 » TCEC Season 8 [15]
- A Chess Firewall at Zero? by Ken Regan, Gödel's Lost Letter and P=NP, January 21, 2016
- When Data Serves Turkey by Ken Regan, Gödel's Lost Letter and P=NP, November 30, 2016
- Magnus and the Turkey Grinder by Ken Regan, Gödel's Lost Letter and P=NP, December 08, 2016 » Match Statistics, Pawn Advantage, Win Percentage, and Elo [16] [17]
- Stopped Watches and Data Analytics by Ken Regan, Gödel's Lost Letter and P=NP, May 23, 2017
- Re: "Intrinsic Chess Ratings" by Regan, Haworth -- by Kenneth Regan, CCC, November 20, 2017 » Who is the Master?
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
- Kenneth W. Regan - UB Computer Science and Engineering
- Gödel's Lost Letter and P=NP by Dick Lipton and Ken Regan
- Kenneth Regan - The Mathematics Genealogy Project
- Regan, Kenneth FIDE Chess Profile
- The chess games of Kenneth Regan from chessgames.com
- Buffalo Niagara Chess Corner: Kenneth W. Regan, International Master is 2010 Mayor's Cup Masters Champion
- Buffalo Niagara Chess Corner: UNDEFEATED KENNETH W. REGAN, Ph.D, WINS!
- The United States Chess Federation - How To Catch A Chess Cheater: Ken Regan Finds Moves Out Of Mind by Howard Goldowsky, June 1, 2014
References
- ↑ UB CSE Department: Kenneth W. Regan
- ↑ UB Computer Science and Engineering
- ↑ Measuring Fidelity to a Computer Agent
- ↑ Regan, Kenneth FIDE Chess Profile
- ↑ dblp: Kenneth W. Regan
- ↑ Kenneth W. Regan - Selected Publications
- ↑ Analyzing Kasparov versus the World using the EGTBs by Peter Karrer
- ↑ Peter Karrer (2000). KQQKQP and KQPKQP≈. ICGA Journal, Vol. 23, No. 2
- ↑ Jacobian matrix and determinant from Wikipedia
- ↑ Gröbner basis from Wikipedia
- ↑ Bayesian inference from Wikipedia
- ↑ "Intrinsic Chess Ratings" by Regan, Haworth -- seq by Kai Middleton, CCC, November 19, 2017
- ↑ The New Chess World Champion by Bajusz Tamás, CCC, December 28, 2014
- ↑ Regan's latest: Depth of Satisficing by Carl Lumma, CCC, October 09, 2015
- ↑ Is the current Komodo that close to perfection? by Bajusz Tamás, CCC, November 28, 2015
- ↑ World Chess Championship 2016 from Wikipedia
- ↑ Regan's conundrum by Carl Lumma, CCC, December 09, 2016
- ↑ Kasparov versus the World from Wikipedia
