Ryan Rifkin

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Ryan Rifkin

Ryan Michael Rifkin,
an American mathematician and computer scientist with expertise in machine learning, affiliated with Google Inc. [1], Mountain View, California and previously at Honda Research Institute, Boston, and the MIT Center for Biological and Computational Learning. He holds a Ph.D. from MIT on machine learning in 2002 [2]. In the early 90s, along with primary author Bradley Kuszmaul, Ryan Rifkin co-authored the massive parallel chess program StarTech which competed the ACM 1993 running on a CM-5 [3] [4]. He optimized some move generation routines in assembly language, and cleaned up the parallel work-stealing code.


from Bradley Kuszmaul's Ph.D. thesis [5]

The code for move generation and checking illegal moves, which takes a total of 3.5% of the cycles, was optimized in assembly language by Ryan Rifkin under the direction of Mark Bromley of Thinking Machines Corporation. Before Ryan worked on that code, the move generation and illegal move checking accounted for about 9% of all the cycles. 

Selected Publications


1998 ...

2000 ...

External Links


  1. Ryan M. Rifkin | Google Inc., Mountain View | Google
  2. Ryan M. Rifkin (2002). Everything Old Is New Again: A Fresh Look at Historical Approaches to Machine Learning. Ph. D thesis, MIT
  3. The 23rd ACM International Computer Chess Championship from The Computer History Museum, pdf
  4. Re: Hash tables----Clash!!!-What happens next? by Albert Gower, rec.games.chess, March 19, 1994
  5. Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. thesis, Department of Electrical Engineering and Computer Science, MIT, pdf, pp. 130, 6.6 How Time is Spent in StarTech
  6. dblp: Ryan M. Rifkin
  7. Tikhonov regularization from Wikipedia named for Andrey N. Tikhonov
  8. Fenchel's duality theorem from Wikipedia named after Werner Fenchel

Up one level