Reconstructing Sets from Interpoint Distances (Extended Abstract). - Steven Skiena; Warren D. Smith; Paul Lemke (SCG, 1990)

A new table of constant weight codes. - Andries E. Brouwer; James B. Shearer; Neil J. A. Sloane; Warren D. Smith (IEEE Trans. Inf. Theory, 1990)

How To Find Steiner Minimal Trees in Euclidean d-Space. - Warren D. Smith (Algorithmica, 1992)

Steiner Tree Problems. - Warren D. Smith; Peter W. Shor (Algorithmica, 1992)

A Simple Method for Resolving Degeneracies in Delaunay Triangulations. - Michael B. Dillencourt; Warren D. Smith (ICALP, 1993)

A Test Suite for Chess Programs. - Kevin J. Lang; Warren D. Smith (J. Int. Comput. Games Assoc., 1993)

Shallow Excluded Minors and Improved Graph Decompositions. - Serge A. Plotkin; Satish Rao; Warren D. Smith (SODA, 1994)

DNA computers in vitro and vivo. - Warren D. Smith (DNA Based Computers, 1995)

Nonabelian sets with distinct k-sums. - Andrew M. Odlyzko; Warren D. Smith (Discret. Math., 1995)

A linear-time algorithm for testing the inscribability of trivalent polyhedra. - Michael B. Dillencourt; Warren D. Smith (Int. J. Comput. Geom. Appl., 1995)

On the Steiner Ratio in 3-Space. - Warren D. Smith; J. MacGregor Smith (J. Comb. Theory A, 1995)

Graph-theoretical conditions for inscribability and Delaunay realizability. - Michael B. Dillencourt; Warren D. Smith (Discret. Math., 1996)

Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions. - Ding-Zhu Du; Warren D. Smith (J. Comb. Theory A, 1996)

A Bayesian Approach to Relevance in Game Playing. - Eric B. Baum; Warren D. Smith (Artif. Intell., 1997)

Geometric Separator Theorems & Applications. - Warren D. Smith; Nicholas C. Wormald (FOCS, 1998)

Approximating Geometrical Graphs via "Spanners" and "Banyans". - Satish Rao; Warren D. Smith (STOC, 1998)

Propagating Distributions Up Directed Acyclic Graphs. - Eric B. Baum; Warren D. Smith (Neural Comput., 1999)

Testing that distributions are close. - Tugkan Batu; Lance Fortnow; Ronitt Rubinfeld; Warren D. Smith; Patrick White (FOCS, 2000)

A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. - Warren D. Smith (Eur. J. Comb., 2000)

Church's thesis meets the N-body problem. - Warren D. Smith (Appl. Math. Comput., 2006)

Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks. - Warren D. Smith (Appl. Math. Comput., 2006)

Three Voting Protocols: ThreeBallot, VAV, and Twin. - Warren D. Smith (EVT, 2007)

1. AES seems weak. 2. Linear time secure cryptography. - Warren D. Smith (IACR Cryptol. ePrint Arch., 2007)

Linear-time nearest point algorithms for coxeter lattices. - Robby G. McKilliam; Warren D. Smith; I. Vaughan L. Clarkson (IEEE Trans. Inf. Theory, 2010)

Tetherless ergonomics workstation to assess nurses' physical workload in a clinical setting. - Warren D. Smith; Michael E. Nave; Alan P. Hreljac (EMBC, 2011)

Novel method for quantitative assessment of physical workload of healthcare workers by a tetherless ergonomics workstation. - Warren D. Smith; Kamal A. Alharbi; Jeremy B. Dixon; Hind Reggad (EMBC, 2012)

Testing Closeness of Discrete Distributions. - Tugkan Batu; Lance Fortnow; Ronitt Rubinfeld; Warren D. Smith; Patrick White (J. ACM, 2013)

DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity. - Dhananjay S. Phatak; Qiang Tang 001; Alan T. Sherman; Warren D. Smith; Peter Y. A. Ryan; Konstantinos Kalpakis (IACR Cryptol. ePrint Arch., 2014)

Probabilistic lower bounds on maximal determinants of binary matrices. - Richard P. Brent; Judy-anne H. Osborn; Warren D. Smith (Australas. J Comb., 2016)