25,161
edits
Changes
Created page with "'''Home * People * Warren D. Smith''' '''Warren Douglas Smith''',<br/> an American physicist, mathematician, general theoretical scientist, and in 2005 fou..."
'''[[Main Page|Home]] * [[People]] * Warren D. Smith'''
'''Warren Douglas Smith''',<br/>
an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the ''Center of Range Voting'' <ref>[https://rangevoting.org/ Center for Range Voting - front page]</ref>.
He received a double [https://en.wikipedia.org/wiki/Bachelor_of_Science B.Sc.] from [[Massachusetts Institute of Technology]] in [https://en.wikipedia.org/wiki/Physics physics] and [https://en.wikipedia.org/wiki/Mathematics mathematics], and a Ph.D. at [https://en.wikipedia.org/wiki/Princeton_University Princeton University] in the field of [https://en.wikipedia.org/wiki/Applied_mathematics applied mathematics] on [https://en.wikipedia.org/wiki/Computational_geometry computational geometry] motivated by [https://en.wikipedia.org/wiki/Mesh_generation Mesh generation],
where his advisors were [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]</ref>.
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS].
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics], [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy].
=BPIP-DFISA=
Along with [[Eric B. Baum]] et al., Warren D. Smith worked and published on [[Search|game tree search]],
in particular the [[BPIP-DFISA]] (Best play for imperfect players - Depth free independent staircase approximation) search control model
<ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''Best Play for Imperfect Players and Game Tree Search''. Part 1 - Theory, with pseudocode appendix by [[Charles Garrett]], [https://pdfs.semanticscholar.org/5838/432c92c8905c7066962400c55ddc8803f11a.pdf pdf]</ref>
<ref>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref>,
further generalized in 2004 by [[Yan Radovilsky]] and [[Solomon Eyal Shimony]] <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://www.cs.bgu.ac.il/%7Eyanr/Publications/smc04.pdf pdf]</ref>.
=Smith Notation=
Warren D. Smith proposed the [[Algebraic Chess Notation#Smith|Smith notation]] <ref>[https://web.archive.org/web/20160117212352/https://www.chessclub.com/chessviewer/smith.html Smith notation] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])</ref> as used in the [[Internet Chess Club]] chess server.
The Smith notation [[Encoding Moves|encodes moves]] without any ambiguity using [[Origin Square|from-square]], [[Target Square|to-square]], and to make it reversible, the [[Captures|captured]] piece if any - so it is as easy to go backwards as forwards while re-playing a game.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Smith:Warren_D= dblp: Warren D. Smith]</ref> <ref>[https://www.rangevoting.org/WarrenSmithPages/homepage/works.html Online list of Warren D. Smith's works]</ref>
==1989==
* [[Warren D. Smith]] ('''1989'''). ''[https://dl.acm.org/doi/book/10.5555/915627 Studies in Computational Geometry Motivated by Mesh Generation]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Princeton_University Princeton University], advisors [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://en.wikipedia.org/wiki/Mesh_generation Mesh generation from Wikipedia]</ref>
==1990 ...==
* [[Mathematician#AEBrouwer|Andries E. Brouwer]], [[Mathematician#JBShearer|James B. Shearer]], [[Mathematician#NSloane|Neil Sloane]], [[Warren D. Smith]] ('''1990'''). ''[https://ieeexplore.ieee.org/document/59932 A New Table of Constant Weight Codes]''. [[IEEE#TIT|IEEE Transactions of Information Theory]], Vol. 36
* [[Steven Skiena]], [[Warren D. Smith]], [https://dblp.uni-trier.de/pers/hd/l/Lemke:Paul Paul Lemke] ('''1990'''). ''[https://dl.acm.org/doi/10.1145/98524.98598 Reconstructing Sets from Interpoint Distances]''. [https://dblp.uni-trier.de/db/conf/compgeom/compgeom90.html Symposium on Computational Geometry]
* [[Warren D. Smith]] ('''1992'''). ''[https://link.springer.com/article/10.1007/BF01758756 How To Find Steiner Minimal Trees in Euclidean d-Space]''. [https://en.wikipedia.org/wiki/Algorithmica Algorithmica], Vol. 7, Nos. 2-6 <ref>[https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner tree problem from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Euclidean_space Euclidean space from Wikipedia]</ref>
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/fundphys.sue Fundamental Physical Limits on Computation]''.
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/kuczma.sue Fixed Point for Negamaxing Probability Distributions on Regular Trees]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/gohash.abstract Hash functions for Binary and Ternary Words]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Kevin J. Lang]], [[Warren D. Smith]] ('''1993'''). ''A Test Suite for Chess Programs''. [https://scorevoting.net/WarrenSmithPages/homepage/testpos.ps ps], [https://www.rangevoting.org/WarrenSmithPages/homepage/ChessTest2.tar.Z ChessTest2.tar.Z]
* [[Warren D. Smith]] ('''1993'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/ratingspap.abstract Rating Systems for Gameplayers, and Learning]''.
* [[Warren D. Smith]], [[Kevin J. Lang]] ('''1994'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/mergepap.sue Values of the merging function and algorithm design as a game]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
==1995 ...==
* [[Kevin J. Lang]], [[Warren D. Smith]] ('''1995'''). ''A Test Suite for Chess Programs''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]
* [[Warren D. Smith]], [[Eric B. Baum]], [[Charles Garrett]], [[Rico Tudor]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-Part-Smith-Baum/3ce418d28c967ef2b79bd509127b5bba334d2b6a Best Play for Imperfect Players and Game Tree Search]''. Part 2 - Experiments
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1997'''). ''[https://www.semanticscholar.org/paper/A-Bayesian-Approach-to-Relevance-in-Game-Playing-Baum-Smith/a157ece9e259fda728485373234d119addd1fe25 A Bayesian Approach to Relevance in Game Playing]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 97
* [[Warren D. Smith]] ('''1998'''). ''Taking the Fuzz Out of Fuzzy Logic''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881?journalCode=neco Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1
==2000 ...==
* [[Warren D. Smith]] ('''2000'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.sue Range Voting]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/l/Lemke:Paul Paul Lemke], [[Steven Skiena]], [[Warren D. Smith]] ('''2002'''). ''[http://archive.dimacs.rutgers.edu/TechnicalReports/abstracts/2002/2002-37.html Reconstructing Sets from Interpoint Distances]''. [https://en.wikipedia.org/wiki/DIMACS DIMACS] Technical Report: 2002-37
* [[Warren D. Smith]] ('''2003'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/newvec.abs A new theorem in vector calculus]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/newvec.pdf pdf]
* [[Warren D. Smith]] ('''2004'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/dirdem.abs Direct Democracy]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/dirdem.pdf pdf]
* [[Warren D. Smith]] ('''2006'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/church.sue Church's thesis meets the N-body problem]''. [https://www.journals.elsevier.com/applied-mathematics-and-computation Applied Mathematics and Computation], Vol. 178, No. 1, [https://www.rangevoting.org/WarrenSmithPages/homepage/church.pdf pdf preprint] <ref>[https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Church–Turing thesis from Wikipedia]</ref>
* [[Warren D. Smith]] ('''2007'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/wdsAES.abs 1. AES seems weak. 2. Linear time secure cryptography]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/wdsAES.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Advanced_Encryption_Standard Advanced Encryption Standard from Wikipedia]</ref>
* [[Mathematician#RGMcKilliam|Robby G. McKilliam]], [[Warren D. Smith]], [[Mathematician#IVLClarkson|I. Vaughan L. Clarkson]] ('''2009'''). ''Linear-time nearest point algorithms for Coxeter lattices''. 8https://arxiv.org/abs/0903.0673 arXiv:0903.0673]
==2010 ...==
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2014'''). ''Lower bounds on maximal determinants of +-1 matrices via the probabilistic method''. [https://arxiv.org/abs/1211.3248 arXiv:1211.3248]
* [[Warren D. Smith]] ('''2014'''). ''[https://www.rangevoting.org/EnvyFree.html Envy-Free allocations]''.
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2014'''). ''ounds on determinants of perturbed diagonal matrices''. [https://en.wikipedia.org/wiki/Linear_Algebra_and_Its_Applications Linear Algebra and its Applications], Vol. 466, [https://arxiv.org/abs/1401.7084 arXiv:1401.7084]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Lower bounds on maximal determinants of binary matrices via the probabilistic method''. [https://arxiv.org/abs/1402.6817 arXiv:1402.6817]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Probabilistic lower bounds on maximal determinants of binary matrices''. [https://en.wikipedia.org/wiki/Australasian_Journal_of_Combinatorics Australasian Journal of Combinatorics], Vol. 66, [https://arxiv.org/abs/1501.06235 arXiv:1501.06235]
=External Links=
* [http://wdstalks.blogspot.com/ Warren D. Smith's blog]
: [http://wdstalks.blogspot.de/2013/03/the-future-of-computers-ai-artificial.html The Future of Computers, AI (artificial intelligence), etc -- aka, You're gonna die, sucker] by [[Warren D. Smith]], March 07, 2013
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]
* [https://www.rangevoting.org/ RangeVoting.org - Center for Range Voting]
* [https://www.rangevoting.org/WarrenSmithPages/homepage/myresume.html Resume of Warren D. Smith]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Smith]]
[[Category:Mathematician|Smith]]
'''Warren Douglas Smith''',<br/>
an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the ''Center of Range Voting'' <ref>[https://rangevoting.org/ Center for Range Voting - front page]</ref>.
He received a double [https://en.wikipedia.org/wiki/Bachelor_of_Science B.Sc.] from [[Massachusetts Institute of Technology]] in [https://en.wikipedia.org/wiki/Physics physics] and [https://en.wikipedia.org/wiki/Mathematics mathematics], and a Ph.D. at [https://en.wikipedia.org/wiki/Princeton_University Princeton University] in the field of [https://en.wikipedia.org/wiki/Applied_mathematics applied mathematics] on [https://en.wikipedia.org/wiki/Computational_geometry computational geometry] motivated by [https://en.wikipedia.org/wiki/Mesh_generation Mesh generation],
where his advisors were [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]</ref>.
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS].
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics], [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy].
=BPIP-DFISA=
Along with [[Eric B. Baum]] et al., Warren D. Smith worked and published on [[Search|game tree search]],
in particular the [[BPIP-DFISA]] (Best play for imperfect players - Depth free independent staircase approximation) search control model
<ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''Best Play for Imperfect Players and Game Tree Search''. Part 1 - Theory, with pseudocode appendix by [[Charles Garrett]], [https://pdfs.semanticscholar.org/5838/432c92c8905c7066962400c55ddc8803f11a.pdf pdf]</ref>
<ref>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref>,
further generalized in 2004 by [[Yan Radovilsky]] and [[Solomon Eyal Shimony]] <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://www.cs.bgu.ac.il/%7Eyanr/Publications/smc04.pdf pdf]</ref>.
=Smith Notation=
Warren D. Smith proposed the [[Algebraic Chess Notation#Smith|Smith notation]] <ref>[https://web.archive.org/web/20160117212352/https://www.chessclub.com/chessviewer/smith.html Smith notation] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])</ref> as used in the [[Internet Chess Club]] chess server.
The Smith notation [[Encoding Moves|encodes moves]] without any ambiguity using [[Origin Square|from-square]], [[Target Square|to-square]], and to make it reversible, the [[Captures|captured]] piece if any - so it is as easy to go backwards as forwards while re-playing a game.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Smith:Warren_D= dblp: Warren D. Smith]</ref> <ref>[https://www.rangevoting.org/WarrenSmithPages/homepage/works.html Online list of Warren D. Smith's works]</ref>
==1989==
* [[Warren D. Smith]] ('''1989'''). ''[https://dl.acm.org/doi/book/10.5555/915627 Studies in Computational Geometry Motivated by Mesh Generation]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Princeton_University Princeton University], advisors [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://en.wikipedia.org/wiki/Mesh_generation Mesh generation from Wikipedia]</ref>
==1990 ...==
* [[Mathematician#AEBrouwer|Andries E. Brouwer]], [[Mathematician#JBShearer|James B. Shearer]], [[Mathematician#NSloane|Neil Sloane]], [[Warren D. Smith]] ('''1990'''). ''[https://ieeexplore.ieee.org/document/59932 A New Table of Constant Weight Codes]''. [[IEEE#TIT|IEEE Transactions of Information Theory]], Vol. 36
* [[Steven Skiena]], [[Warren D. Smith]], [https://dblp.uni-trier.de/pers/hd/l/Lemke:Paul Paul Lemke] ('''1990'''). ''[https://dl.acm.org/doi/10.1145/98524.98598 Reconstructing Sets from Interpoint Distances]''. [https://dblp.uni-trier.de/db/conf/compgeom/compgeom90.html Symposium on Computational Geometry]
* [[Warren D. Smith]] ('''1992'''). ''[https://link.springer.com/article/10.1007/BF01758756 How To Find Steiner Minimal Trees in Euclidean d-Space]''. [https://en.wikipedia.org/wiki/Algorithmica Algorithmica], Vol. 7, Nos. 2-6 <ref>[https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner tree problem from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Euclidean_space Euclidean space from Wikipedia]</ref>
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/fundphys.sue Fundamental Physical Limits on Computation]''.
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/kuczma.sue Fixed Point for Negamaxing Probability Distributions on Regular Trees]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Warren D. Smith]] ('''1992'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/gohash.abstract Hash functions for Binary and Ternary Words]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Kevin J. Lang]], [[Warren D. Smith]] ('''1993'''). ''A Test Suite for Chess Programs''. [https://scorevoting.net/WarrenSmithPages/homepage/testpos.ps ps], [https://www.rangevoting.org/WarrenSmithPages/homepage/ChessTest2.tar.Z ChessTest2.tar.Z]
* [[Warren D. Smith]] ('''1993'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/ratingspap.abstract Rating Systems for Gameplayers, and Learning]''.
* [[Warren D. Smith]], [[Kevin J. Lang]] ('''1994'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/mergepap.sue Values of the merging function and algorithm design as a game]''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
==1995 ...==
* [[Kevin J. Lang]], [[Warren D. Smith]] ('''1995'''). ''A Test Suite for Chess Programs''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]
* [[Warren D. Smith]], [[Eric B. Baum]], [[Charles Garrett]], [[Rico Tudor]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-Part-Smith-Baum/3ce418d28c967ef2b79bd509127b5bba334d2b6a Best Play for Imperfect Players and Game Tree Search]''. Part 2 - Experiments
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1997'''). ''[https://www.semanticscholar.org/paper/A-Bayesian-Approach-to-Relevance-in-Game-Playing-Baum-Smith/a157ece9e259fda728485373234d119addd1fe25 A Bayesian Approach to Relevance in Game Playing]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 97
* [[Warren D. Smith]] ('''1998'''). ''Taking the Fuzz Out of Fuzzy Logic''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881?journalCode=neco Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1
==2000 ...==
* [[Warren D. Smith]] ('''2000'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.sue Range Voting]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/l/Lemke:Paul Paul Lemke], [[Steven Skiena]], [[Warren D. Smith]] ('''2002'''). ''[http://archive.dimacs.rutgers.edu/TechnicalReports/abstracts/2002/2002-37.html Reconstructing Sets from Interpoint Distances]''. [https://en.wikipedia.org/wiki/DIMACS DIMACS] Technical Report: 2002-37
* [[Warren D. Smith]] ('''2003'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/newvec.abs A new theorem in vector calculus]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/newvec.pdf pdf]
* [[Warren D. Smith]] ('''2004'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/dirdem.abs Direct Democracy]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/dirdem.pdf pdf]
* [[Warren D. Smith]] ('''2006'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/church.sue Church's thesis meets the N-body problem]''. [https://www.journals.elsevier.com/applied-mathematics-and-computation Applied Mathematics and Computation], Vol. 178, No. 1, [https://www.rangevoting.org/WarrenSmithPages/homepage/church.pdf pdf preprint] <ref>[https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Church–Turing thesis from Wikipedia]</ref>
* [[Warren D. Smith]] ('''2007'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/wdsAES.abs 1. AES seems weak. 2. Linear time secure cryptography]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/wdsAES.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Advanced_Encryption_Standard Advanced Encryption Standard from Wikipedia]</ref>
* [[Mathematician#RGMcKilliam|Robby G. McKilliam]], [[Warren D. Smith]], [[Mathematician#IVLClarkson|I. Vaughan L. Clarkson]] ('''2009'''). ''Linear-time nearest point algorithms for Coxeter lattices''. 8https://arxiv.org/abs/0903.0673 arXiv:0903.0673]
==2010 ...==
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2014'''). ''Lower bounds on maximal determinants of +-1 matrices via the probabilistic method''. [https://arxiv.org/abs/1211.3248 arXiv:1211.3248]
* [[Warren D. Smith]] ('''2014'''). ''[https://www.rangevoting.org/EnvyFree.html Envy-Free allocations]''.
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2014'''). ''ounds on determinants of perturbed diagonal matrices''. [https://en.wikipedia.org/wiki/Linear_Algebra_and_Its_Applications Linear Algebra and its Applications], Vol. 466, [https://arxiv.org/abs/1401.7084 arXiv:1401.7084]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Lower bounds on maximal determinants of binary matrices via the probabilistic method''. [https://arxiv.org/abs/1402.6817 arXiv:1402.6817]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Probabilistic lower bounds on maximal determinants of binary matrices''. [https://en.wikipedia.org/wiki/Australasian_Journal_of_Combinatorics Australasian Journal of Combinatorics], Vol. 66, [https://arxiv.org/abs/1501.06235 arXiv:1501.06235]
=External Links=
* [http://wdstalks.blogspot.com/ Warren D. Smith's blog]
: [http://wdstalks.blogspot.de/2013/03/the-future-of-computers-ai-artificial.html The Future of Computers, AI (artificial intelligence), etc -- aka, You're gonna die, sucker] by [[Warren D. Smith]], March 07, 2013
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]
* [https://www.rangevoting.org/ RangeVoting.org - Center for Range Voting]
* [https://www.rangevoting.org/WarrenSmithPages/homepage/myresume.html Resume of Warren D. Smith]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Smith]]
[[Category:Mathematician|Smith]]
