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]}.

^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.

Home * People * Gary LindstromGary 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 ofEvolving 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 dubbedThe Key Node Method^{[5]}.^{[6]}## Table of Contents

## Selected Publications

^{[7]}## 1970 ...

1970).The Design of Parsers for Incremental Language Processors. STOC 19701971).Variability in Language Processors. Ph.D. thesis, Carnegie Mellon University1973).Scanning List Structures Without Stacks or Tag Bits. Information Processing Letters, Vol. 2, No. 21974).Algorithms for list structure condensation. International Journal of Parallel Programming, Vol. 3, No. 31974).Copying List Structures Using Bounded Workspace. Communications of the ACM, Vol. 17, No. 41979).Alpha-Beta Pruning on Evolving Game Trees. Technical Report UUCCS 79-101, University of Utah, UScholar Works1979).Backtracking in a Generalized Control Setting. ACM Transactions on Programming Languages and Systems, Vol. 1, No. 1## 1980 ...

1983).The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm. Technical Report UUCCS 83-101, University of Utah, pdf1986).Integrating Functional and Logic Programming. IEEE Software, Vol. 3, No. 11986).Logic Programming: Functions, Relations and Equations. Prentice-Hall, ISBN 978-0-13-539958-31987).Combinator Evaluation of Functional Programs with Logical Variables. Technical Report UUCCS 87-027, pdf## 1990 ...

1990).Combinator Evaluation of Functional Programs with Logical Variables. Lisp and Symbolic Computation, Vol. 3, No. 31992).Modularity meets inheritance. ICCL 1992, CiteSeerX## 2000 ...

2002).Specifying Java Thread Semantics Using a Uniform Memory Model. Java Grande 2002, pdf2004).Memory-Model-Sensitive Data Race Analysis. ICFEM 2004## External Links

## References

1979).Alpha-Beta Pruning on Evolving Game Trees. Technical Report UUCCS 79-101, University of Utah, UScholar Works1980).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.1983).The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm. Technical Report UUCCS 83-101, University of Utah, pdf## What links here?

Up one level