Gary+Lindstrom

an American mathematician, computer scientist, and [|professor emeritus] at School of Computing, [|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. He worked on search algorithms, in particular, like SSS*, the logically parallel alpha-beta approach of //Evolving Tree Search// (ets), and based on ets and the Mandatory Work First (mwf) approach by Selim Akl et al. , the highly-parallel alpha-beta algorithm dubbed //The Key Node Method//. || toc =Selected Publications=
 * Home * People * Gary Lindstrom**
 * [[image:GaryLindstrom1984.jpg link="https://www.facebook.com/photo.php?fbid=504779916338087&set=a.504779966338082.1073741829.100004182496858&type=3&theater"]] ||~ || **Gary Edward Lindstrom**,
 * Gary Lindstrom ||~ ||^ ||

1970 ...

 * Gary Lindstrom (**1970**). //The Design of Parsers for Incremental Language Processors//. [|STOC 1970]
 * Gary Lindstrom (**1971**). //[|Variability in Language Processors]//. Ph.D. thesis, Carnegie Mellon University
 * Gary Lindstrom (**1973**). //Scanning List Structures Without Stacks or Tag Bits//. [|Information Processing Letters], Vol. 2, No. 2
 * Gary Lindstrom (**1974**). //[|Algorithms for list structure condensation]//. [|International Journal of Parallel Programming], Vol. 3, No. 3
 * Gary Lindstrom (**1974**). //[|Copying List Structures Using Bounded Workspace]//. Communications of the ACM, Vol. 17, No. 4
 * Gary Lindstrom (**1979**). //Alpha-Beta Pruning on Evolving Game Trees//. Technical Report UUCCS 79-101, [|University of Utah], [|UScholar Works]
 * Gary Lindstrom (**1979**). //[|Backtracking in a Generalized Control Setting]//. ACM Transactions on Programming Languages and Systems, Vol. 1, No. 1

1980 ...

 * Gary Lindstrom (**1983**). //The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm//. Technical Report UUCCS 83-101, [|University of Utah], [|pdf]
 * Gary Lindstrom (**1986**). //[|Integrating Functional and Logic Programming]//. IEEE Software, Vol. 3, No. 1
 * [|Doug DeGroot], Gary Lindstrom (eds.) (**1986**). //[|Logic Programming: Functions, Relations and Equations]//. [|Prentice-Hall], ISBN 978-0-13-539958-3
 * [|Göran Båge], Gary Lindstrom (**1987**). //Combinator Evaluation of Functional Programs with Logical Variables//. Technical Report UUCCS 87-027, [|pdf]

1990 ...

 * [|Göran Båge], Gary Lindstrom (**1990**). //[|Combinator Evaluation of Functional Programs with Logical Variables]//. [|Lisp and Symbolic Computation], Vol. 3, No. 3
 * Gilad Bracha, Gary Lindstrom (**1992**). //Modularity meets inheritance//. [|ICCL 1992], [|CiteSeerX]

2000 ...

 * [|Yue Yang], [|Ganesh Gopalakrishnan], Gary Lindstrom (**2002**). //Specifying Java Thread Semantics Using a Uniform Memory Model//. [|Java Grande 2002], [|pdf]
 * [|Yue Yang], [|Ganesh Gopalakrishnan], Gary Lindstrom (**2004**). //[|Memory-Model-Sensitive Data Race Analysis]//. [|ICFEM 2004]

=External Links=
 * [|Gary Lindstrom]
 * [|Gary Lindstrom from Wikipedia]
 * [|Gary Lindstrom | Facebook]
 * [|The Mathematics Genealogy Project - Gary Lindstrom]

=References= =What links here?= include page="Gary Lindstrom" component="backlinks" limit="40"
 * Up one level**