25,161
edits
Changes
Created page with "'''Home * People * Gary Lindstrom''' FILE:GaryLindstrom1984.jpg|border|right|thumb|link=https://www.facebook.com/photo.php?fbid=504779916338087&set=a.5047..."
'''[[Main Page|Home]] * [[People]] * Gary Lindstrom'''
[[FILE:GaryLindstrom1984.jpg|border|right|thumb|link=https://www.facebook.com/photo.php?fbid=504779916338087&set=a.504779966338082.1073741829.100004182496858&type=3&theater|Gary Lindstrom <ref>Gary Lindstrom, 1984 in Southern France, Image cropped from [https://www.facebook.com/gary.lindstrom.146 Gary Lindstrom | Facebook]</ref> ]]
'''Gary Edward Lindstrom''',<br/>
an American mathematician, computer scientist, and [https://en.wikipedia.org/wiki/Professors_in_the_United_States#Professor_emeritus_and_emerita professor emeritus] at School of Computing <ref>[http://www.cs.utah.edu/ School of Computing | The University of Utah]</ref>, [https://en.wikipedia.org/wiki/University_of_Utah 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 [[Mathematician#Perlis|Alan Jay Perlis]]. Among his research interests are [https://en.wikipedia.org/wiki/Data_management data management], [https://en.wikipedia.org/wiki/Formal_verification verification], and [[Languages|programming language design]], specification and implementation <ref>[http://www.cs.utah.edu/~gary/ Gary Lindstrom]</ref>. He worked on [[Search|search]] algorithms, in particular, like [[SSS* and Dual*|SSS*]], the logically parallel [[Alpha-Beta|alpha-beta]] approach of ''Evolving Tree Search'' (ets) <ref>[[Gary Lindstrom]] ('''1979'''). ''Alpha-Beta Pruning on Evolving Game Trees''. Technical Report UUCCS 79-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/cdm/ref/collection/uspace/id/498 UScholar Works]</ref>, and based on ets and the Mandatory Work First (mwf) approach by [[Selim Akl]] et al. <ref>[[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. 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.</ref>, the [[Parallel Search|highly-parallel alpha-beta]] algorithm dubbed ''The Key Node Method'' <ref>[[Gary Lindstrom]] ('''1983'''). ''The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm''. Technical Report UUCCS 83-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3706/filename/image pdf]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/l/Lindstrom:Gary dblp: Gary Lindstrom]</ref>
==1970 ...==
* [[Gary Lindstrom]] ('''1970'''). ''The Design of Parsers for Incremental Language Processors''. [http://dblp.uni-trier.de/db/conf/stoc/stoc70.html#Lindstrom70 STOC 1970]
* [[Gary Lindstrom]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0714695 Variability in Language Processors]''. Ph.D. thesis, [[Carnegie Mellon University]]
* [[Gary Lindstrom]] ('''1973'''). ''Scanning List Structures Without Stacks or Tag Bits''. [http://dblp.uni-trier.de/db/journals/ipl/ipl2.html#Lindstrom73 Information Processing Letters], Vol. 2, No. 2
* [[Gary Lindstrom]] ('''1974'''). ''[http://link.springer.com/article/10.1007%2FBF00977255 Algorithms for list structure condensation]''. [http://dblp.uni-trier.de/db/journals/ijpp/ijpp3.html#Lindstrom74 International Journal of Parallel Programming], Vol. 3, No. 3
* [[Gary Lindstrom]] ('''1974'''). ''[http://dl.acm.org/citation.cfm?id=360936&dl=ACM&coll=DL&CFID=564251988&CFTOKEN=24977485 Copying List Structures Using Bounded Workspace]''. [[ACM#Communications|Communications of the ACM]], Vol. 17, No. 4
* [[Gary Lindstrom]] ('''1979'''). ''Alpha-Beta Pruning on Evolving Game Trees''. Technical Report UUCCS 79-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/cdm/ref/collection/uspace/id/498 UScholar Works]
* [[Gary Lindstrom]] ('''1979'''). ''[http://dl.acm.org/citation.cfm?id=357063 Backtracking in a Generalized Control Setting]''. [[ACM#TOPLAS|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, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3706/filename/image pdf]
* [[Gary Lindstrom]] ('''1986'''). ''[http://www.researchgate.net/publication/220091817_Integrating_Functional_and_Logic_Programming Integrating Functional and Logic Programming]''. [[IEEE|IEEE Software]], Vol. 3, No. 1
* [http://dblp.uni-trier.de/pers/hd/d/DeGroot:Doug Doug DeGroot], [[Gary Lindstrom]] (eds.) ('''1986'''). ''[http://www.sigmod.org/publications/dblp/db/books/collections/DeGrootL86.html Logic Programming: Functions, Relations and Equations]''. [https://en.wikipedia.org/wiki/Prentice_Hall Prentice-Hall], ISBN 978-0-13-539958-3
* [http://dblp.uni-trier.de/pers/hd/b/B=aring=ge:G=ouml=ran Göran Båge], [[Gary Lindstrom]] ('''1987'''). ''Combinator Evaluation of Functional Programs with Logical Variables''. Technical Report UUCCS 87-027, [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3102/filename/1.pdf pdf]
==1990 ...==
* [http://dblp.uni-trier.de/pers/hd/b/B=aring=ge:G=ouml=ran Göran Båge], [[Gary Lindstrom]] ('''1990'''). ''[http://link.springer.com/article/10.1007%2FBF01806101 Combinator Evaluation of Functional Programs with Logical Variables]''. [http://dblp.uni-trier.de/db/journals/lisp/lisp3.html#BageL90 Lisp and Symbolic Computation], Vol. 3, No. 3
* [[Mathematician#GBracha|Gilad Bracha]], [[Gary Lindstrom]] ('''1992'''). ''Modularity meets inheritance''. [http://dblp.uni-trier.de/db/conf/iccl/iccl1992.html#BrachaL92 ICCL 1992], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8782 CiteSeerX]
==2000 ...==
* [http://dblp.uni-trier.de/pers/hd/y/Yang:Yue Yue Yang], [http://dblp.uni-trier.de/pers/hd/g/Gopalakrishnan:Ganesh Ganesh Gopalakrishnan], [[Gary Lindstrom]] ('''2002'''). ''Specifying Java Thread Semantics Using a Uniform Memory Model''. [http://dblp.uni-trier.de/db/conf/java/java2002.html#YangGL02 Java Grande 2002], [http://formalverification.cs.utah.edu/yyang/papers/umm_old.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/y/Yang:Yue Yue Yang], [http://dblp.uni-trier.de/pers/hd/g/Gopalakrishnan:Ganesh Ganesh Gopalakrishnan], [[Gary Lindstrom]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-30482-1_11 Memory-Model-Sensitive Data Race Analysis]''. [http://dblp.uni-trier.de/db/conf/icfem/icfem2004.html#YangGL04 ICFEM 2004]
=External Links=
* [http://www.cs.utah.edu/~gary/ Gary Lindstrom]
* [https://en.wikipedia.org/wiki/Gary_Lindstrom Gary Lindstrom from Wikipedia]
* [https://www.facebook.com/gary.lindstrom.146 Gary Lindstrom | Facebook]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=45628 The Mathematics Genealogy Project - Gary Lindstrom]
=References=
<references>
'''[[People|Up one level]]'''
[[FILE:GaryLindstrom1984.jpg|border|right|thumb|link=https://www.facebook.com/photo.php?fbid=504779916338087&set=a.504779966338082.1073741829.100004182496858&type=3&theater|Gary Lindstrom <ref>Gary Lindstrom, 1984 in Southern France, Image cropped from [https://www.facebook.com/gary.lindstrom.146 Gary Lindstrom | Facebook]</ref> ]]
'''Gary Edward Lindstrom''',<br/>
an American mathematician, computer scientist, and [https://en.wikipedia.org/wiki/Professors_in_the_United_States#Professor_emeritus_and_emerita professor emeritus] at School of Computing <ref>[http://www.cs.utah.edu/ School of Computing | The University of Utah]</ref>, [https://en.wikipedia.org/wiki/University_of_Utah 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 [[Mathematician#Perlis|Alan Jay Perlis]]. Among his research interests are [https://en.wikipedia.org/wiki/Data_management data management], [https://en.wikipedia.org/wiki/Formal_verification verification], and [[Languages|programming language design]], specification and implementation <ref>[http://www.cs.utah.edu/~gary/ Gary Lindstrom]</ref>. He worked on [[Search|search]] algorithms, in particular, like [[SSS* and Dual*|SSS*]], the logically parallel [[Alpha-Beta|alpha-beta]] approach of ''Evolving Tree Search'' (ets) <ref>[[Gary Lindstrom]] ('''1979'''). ''Alpha-Beta Pruning on Evolving Game Trees''. Technical Report UUCCS 79-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/cdm/ref/collection/uspace/id/498 UScholar Works]</ref>, and based on ets and the Mandatory Work First (mwf) approach by [[Selim Akl]] et al. <ref>[[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. 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.</ref>, the [[Parallel Search|highly-parallel alpha-beta]] algorithm dubbed ''The Key Node Method'' <ref>[[Gary Lindstrom]] ('''1983'''). ''The Key Node Method: A Highly-Parallel Alpha-Beta Algorithm''. Technical Report UUCCS 83-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3706/filename/image pdf]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/l/Lindstrom:Gary dblp: Gary Lindstrom]</ref>
==1970 ...==
* [[Gary Lindstrom]] ('''1970'''). ''The Design of Parsers for Incremental Language Processors''. [http://dblp.uni-trier.de/db/conf/stoc/stoc70.html#Lindstrom70 STOC 1970]
* [[Gary Lindstrom]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0714695 Variability in Language Processors]''. Ph.D. thesis, [[Carnegie Mellon University]]
* [[Gary Lindstrom]] ('''1973'''). ''Scanning List Structures Without Stacks or Tag Bits''. [http://dblp.uni-trier.de/db/journals/ipl/ipl2.html#Lindstrom73 Information Processing Letters], Vol. 2, No. 2
* [[Gary Lindstrom]] ('''1974'''). ''[http://link.springer.com/article/10.1007%2FBF00977255 Algorithms for list structure condensation]''. [http://dblp.uni-trier.de/db/journals/ijpp/ijpp3.html#Lindstrom74 International Journal of Parallel Programming], Vol. 3, No. 3
* [[Gary Lindstrom]] ('''1974'''). ''[http://dl.acm.org/citation.cfm?id=360936&dl=ACM&coll=DL&CFID=564251988&CFTOKEN=24977485 Copying List Structures Using Bounded Workspace]''. [[ACM#Communications|Communications of the ACM]], Vol. 17, No. 4
* [[Gary Lindstrom]] ('''1979'''). ''Alpha-Beta Pruning on Evolving Game Trees''. Technical Report UUCCS 79-101, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/cdm/ref/collection/uspace/id/498 UScholar Works]
* [[Gary Lindstrom]] ('''1979'''). ''[http://dl.acm.org/citation.cfm?id=357063 Backtracking in a Generalized Control Setting]''. [[ACM#TOPLAS|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, [https://en.wikipedia.org/wiki/University_of_Utah University of Utah], [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3706/filename/image pdf]
* [[Gary Lindstrom]] ('''1986'''). ''[http://www.researchgate.net/publication/220091817_Integrating_Functional_and_Logic_Programming Integrating Functional and Logic Programming]''. [[IEEE|IEEE Software]], Vol. 3, No. 1
* [http://dblp.uni-trier.de/pers/hd/d/DeGroot:Doug Doug DeGroot], [[Gary Lindstrom]] (eds.) ('''1986'''). ''[http://www.sigmod.org/publications/dblp/db/books/collections/DeGrootL86.html Logic Programming: Functions, Relations and Equations]''. [https://en.wikipedia.org/wiki/Prentice_Hall Prentice-Hall], ISBN 978-0-13-539958-3
* [http://dblp.uni-trier.de/pers/hd/b/B=aring=ge:G=ouml=ran Göran Båge], [[Gary Lindstrom]] ('''1987'''). ''Combinator Evaluation of Functional Programs with Logical Variables''. Technical Report UUCCS 87-027, [http://content.lib.utah.edu/utils/getfile/collection/uspace/id/3102/filename/1.pdf pdf]
==1990 ...==
* [http://dblp.uni-trier.de/pers/hd/b/B=aring=ge:G=ouml=ran Göran Båge], [[Gary Lindstrom]] ('''1990'''). ''[http://link.springer.com/article/10.1007%2FBF01806101 Combinator Evaluation of Functional Programs with Logical Variables]''. [http://dblp.uni-trier.de/db/journals/lisp/lisp3.html#BageL90 Lisp and Symbolic Computation], Vol. 3, No. 3
* [[Mathematician#GBracha|Gilad Bracha]], [[Gary Lindstrom]] ('''1992'''). ''Modularity meets inheritance''. [http://dblp.uni-trier.de/db/conf/iccl/iccl1992.html#BrachaL92 ICCL 1992], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8782 CiteSeerX]
==2000 ...==
* [http://dblp.uni-trier.de/pers/hd/y/Yang:Yue Yue Yang], [http://dblp.uni-trier.de/pers/hd/g/Gopalakrishnan:Ganesh Ganesh Gopalakrishnan], [[Gary Lindstrom]] ('''2002'''). ''Specifying Java Thread Semantics Using a Uniform Memory Model''. [http://dblp.uni-trier.de/db/conf/java/java2002.html#YangGL02 Java Grande 2002], [http://formalverification.cs.utah.edu/yyang/papers/umm_old.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/y/Yang:Yue Yue Yang], [http://dblp.uni-trier.de/pers/hd/g/Gopalakrishnan:Ganesh Ganesh Gopalakrishnan], [[Gary Lindstrom]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-30482-1_11 Memory-Model-Sensitive Data Race Analysis]''. [http://dblp.uni-trier.de/db/conf/icfem/icfem2004.html#YangGL04 ICFEM 2004]
=External Links=
* [http://www.cs.utah.edu/~gary/ Gary Lindstrom]
* [https://en.wikipedia.org/wiki/Gary_Lindstrom Gary Lindstrom from Wikipedia]
* [https://www.facebook.com/gary.lindstrom.146 Gary Lindstrom | Facebook]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=45628 The Mathematics Genealogy Project - Gary Lindstrom]
=References=
<references>
'''[[People|Up one level]]'''
