Gary Lindstrom

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Gary Lindstrom

Gary Lindstrom [1]

Gary Edward Lindstrom,
an American mathematician, computer scientist, and professor emeritus at School of Computing [2], University of Utah. He is a graduate of Carnegie Mellon University, where he earned B.S. and M.S. degrees in mathematics, and a Ph.D. in computer science in 1971 under advisor Alan Jay Perlis. Among his research interests are data management, verification, and programming language design, specification and implementation [3]. He worked on search algorithms, in particular, like SSS*, the logically parallel alpha-beta approach of Evolving Tree Search (ets) [4], and based on ets and the Mandatory Work First (mwf) approach by Selim Akl et al. [5], the highly-parallel alpha-beta algorithm dubbed The Key Node Method [6].

Selected Publications


1970 ...

1980 ...

1990 ...

2000 ...

External Links



Up one level
  1. Gary Lindstrom, 1984 in Southern France, Image cropped from Gary Lindstrom | Facebook
  2. School of Computing | The University of Utah
  3. Gary Lindstrom
  4. Gary Lindstrom (1979). Alpha-Beta Pruning on Evolving Game Trees. Technical Report UUCCS 79-101, University of Utah, UScholar Works
  5. Selim Akl, David T. Barnard, R.J. Doran (1980). Simulation and Analysis in Deriving Time and Storage Requirements for a Parallel Alpha-Beta Pruning Algorithm. IEEE International Conference on Parallel Processing, pp. 231-234.
  6. Gary Lindstrom (1983). The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm. Technical Report UUCCS 83-101, University of Utah, pdf
  7. dblp: Gary Lindstrom