Home * People * Gary Lindstrom
GaryLindstrom1984.jpg

Gary Edward Lindstrom,
an American mathematician, computer scientist, and professor emeritus at School of Computing [1], 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 [2]. He worked on search algorithms, in particular, like SSS*, the logically parallel alpha-beta approach of Evolving Tree Search (ets) [3], and based on ets and the Mandatory Work First (mwf) approach by Selim Akl et al. [4], the highly-parallel alpha-beta algorithm dubbed The Key Node Method [5].
Gary Lindstrom [6]

Selected Publications

[7]

1970 ...

1980 ...

1990 ...

2000 ...


External Links


References

  1. ^ School of Computing | The University of Utah
  2. ^ Gary Lindstrom
  3. ^ Gary Lindstrom (1979). Alpha-Beta Pruning on Evolving Game Trees. Technical Report UUCCS 79-101, University of Utah, UScholar Works
  4. ^ 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.
  5. ^ Gary Lindstrom (1983). The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm. Technical Report UUCCS 83-101, University of Utah, pdf
  6. ^ Gary Lindstrom, 1984 in Southern France, Image cropped from Gary Lindstrom | Facebook
  7. ^ dblp: Gary Lindstrom

What links here?


Up one level