Warren D. Smith

Home * People * Warren D. Smith

Warren Douglas Smith,

an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the Center of Range Voting [1]. He received a double B.Sc. from Massachusetts Institute of Technology in physics and mathematics, and a Ph.D. at Princeton University in the field of applied mathematics on computational geometry motivated by Mesh generation, under Robert E. Tarjan and John H. Conway [2]. He was affiliated with the AT&T Bell Laboratories, the NEC Research Institute, Princeton, New Jersey, where he wrote most of his papers during the 90s, and with DIMACS. His research interest covers the broad range of mathematics, physics, information theory, computer science and politics, amongst other things on algorithms, coding theory, cryptography, combinatorics, computational complexity, game tree search, game theory, computer chess, quantum mechanics, Bayesian statistics, range voting and direct democracy. With the advent of deep learning MCTS chess engines after the AlphaZero publications, Warren D. Smith contributed to Leela Chess Zero as well as Stockfish discussions in LCZero and FishCooking forums respectively.

BPIP-DFISA

Along with Eric B. Baum et al., Warren D. Smith worked and published on game tree search, in particular the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model [4] [5], further generalized in 2004 by Yan Radovilsky and Solomon Eyal Shimony [6].

Warren D. Smith proposed the Smith notation [7] as used in the Internet Chess Club chess server. The Smith notation encodes moves without any ambiguity using from-square, to-square, and to make it reversible, the captured piece if any - so it is as easy to go backwards as forwards while re-playing a game.

Warren D. Smith (2000). Range Voting. pdf
Paul Lemke, Steven Skiena, Warren D. Smith (2002). Reconstructing Sets from Interpoint Distances. DIMACS Technical Report: 2002-37
Warren D. Smith (2003). A new theorem in vector calculus. pdf
Warren D. Smith (2004). Direct Democracy. pdf
Warren D. Smith (2006). Church’s thesis meets the N-body problem. Applied Mathematics and Computation, Vol. 178, No. 1, pdf preprint [14]
Warren D. Smith (2007). 1. AES seems weak. 2. Linear time secure cryptography. pdf [15]
Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson (2009). Linear-time nearest point algorithms for Coxeter lattices. 8https://arxiv.org/abs/0903.0673 arXiv:0903.0673]

Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2014). Lower bounds on maximal determinants of +-1 matrices via the probabilistic method. arXiv:1211.3248
Warren D. Smith (2014). Envy-Free allocations.
Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2014). ounds on determinants of perturbed diagonal matrices. Linear Algebra and its Applications, Vol. 466, arXiv:1401.7084
Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2016). Lower bounds on maximal determinants of binary matrices via the probabilistic method. arXiv:1402.6817
Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2016). Probabilistic lower bounds on maximal determinants of binary matrices. Australasian Journal of Combinatorics, Vol. 66, arXiv:1501.06235