Warren D. Smith

According to our database, Warren D. Smith authored at least 29 papers between 1990 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2016

Probabilistic lower bounds on maximal determinants of binary matrices.

Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith

Australas. J Comb., 2016

2014

DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity.

Dhananjay S. Phatak, Qiang Tang, Alan T. Sherman, Warren D. Smith, Peter Y. A. Ryan, Konstantinos Kalpakis

IACR Cryptol. ePrint Arch., 2014

2013

Testing Closeness of Discrete Distributions.

Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White

J. ACM, 2013

2012

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

Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

2011

Tetherless ergonomics workstation to assess nurses' physical workload in a clinical setting.

Warren D. Smith, Michael E. Nave, Alan P. Hreljac

Proceedings of the 33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2011

2010

Linear-time nearest point algorithms for coxeter lattices.

Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson

IEEE Trans. Inf. Theory, 2010

2007

1. AES seems weak. 2. Linear time secure cryptography.

Warren D. Smith

IACR Cryptol. ePrint Arch., 2007

Three Voting Protocols: ThreeBallot, VAV, and Twin.

Warren D. Smith

Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007

2006

Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks.

Warren D. Smith

Appl. Math. Comput., 2006

Church's thesis meets the N-body problem.

Warren D. Smith

Appl. Math. Comput., 2006

2000

A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes.

Warren D. Smith

Eur. J. Comb., 2000

Testing that distributions are close.

Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Propagating Distributions Up Directed Acyclic Graphs.

Eric B. Baum, Warren D. Smith

Neural Comput., 1999

1998

A Bayesian approach to relevance in game playing.

Eric B. Baum, Warren D. Smith

J. Int. Comput. Games Assoc., 1998

Approximating Geometrical Graphs via "Spanners" and "Banyans".

Satish Rao, Warren D. Smith

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Geometric Separator Theorems & Applications.

Warren D. Smith, Nicholas C. Wormald

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

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, Ser. A, 1996

Graph-theoretical conditions for inscribability and Delaunay realizability.

Michael B. Dillencourt, Warren D. Smith

Discret. Math., 1996

1995

On the Steiner Ratio in 3-Space.

Warren D. Smith, J. MacGregor Smith

J. Comb. Theory, Ser. A, 1995

A linear-time algorithm for testing the inscribability of trivalent polyhedra.

Michael B. Dillencourt, Warren D. Smith

Int. J. Comput. Geom. Appl., 1995

Nonabelian sets with distinct k-sums.

Andrew M. Odlyzko, Warren D. Smith

Discret. Math., 1995

DNA computers in vitro and vivo.

Warren D. Smith

Proceedings of the DNA Based Computers, 1995

1994

Shallow Excluded Minors and Improved Graph Decompositions.

Serge A. Plotkin, Satish Rao, Warren D. Smith

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

A Test Suite for Chess Programs.

Kevin J. Lang, Warren D. Smith

J. Int. Comput. Games Assoc., 1993

A Simple Method for Resolving Degeneracies in Delaunay Triangulations.

Michael B. Dillencourt, Warren D. Smith

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Steiner Tree Problems.

Warren D. Smith, Peter W. Shor

Algorithmica, 1992

How To Find Steiner Minimal Trees in Euclidean d-Space.

Warren D. Smith

Algorithmica, 1992

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

Reconstructing Sets from Interpoint Distances (Extended Abstract).

Steven Skiena, Warren D. Smith, Paul Lemke

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990