Warren D. Smith

Publication Activity (10 Years)

Years Active: 1990-2016
Publications (10 Years): 1

Top Topics

Mutual Authentication

Efficient Algorithms To Compute

Top Venues

IACR Cryptol. ePrint Arch.

Australas. J Comb.

Publications

Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith
Probabilistic lower bounds on maximal determinants of binary matrices. Australas. J Comb. 66 (2016)
Dhananjay S. Phatak, Qiang Tang, Alan T. Sherman, Warren D. Smith, Peter Y. A. Ryan, Konstantinos Kalpakis
DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity. IACR Cryptol. ePrint Arch. 2014 (2014)
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
Testing Closeness of Discrete Distributions. J. ACM 60 (1) (2013)
Warren D. Smith, Kamal A. Alharbi, Jeremy B. Dixon, Hind Reggad
Novel method for quantitative assessment of physical workload of healthcare workers by a tetherless ergonomics workstation. EMBC (2012)
Warren D. Smith, Michael E. Nave, Alan P. Hreljac
Tetherless ergonomics workstation to assess nurses' physical workload in a clinical setting. EMBC (2011)
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
Testing Closeness of Discrete Distributions CoRR (2010)
Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson
Linear-time nearest point algorithms for coxeter lattices. IEEE Trans. Inf. Theory 56 (3) (2010)
Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson
Linear-time nearest point algorithms for Coxeter lattices CoRR (2009)
Warren D. Smith
1. AES seems weak. 2. Linear time secure cryptography. IACR Cryptol. ePrint Arch. 2007 (2007)
Warren D. Smith
Three Voting Protocols: ThreeBallot, VAV, and Twin. EVT (2007)
Warren D. Smith
Church's thesis meets the N-body problem. Appl. Math. Comput. 178 (1) (2006)
Warren D. Smith
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks. Appl. Math. Comput. 178 (1) (2006)
Warren D. Smith
A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. Eur. J. Comb. 21 (1) (2000)
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
Testing that distributions are close. FOCS (2000)
Eric B. Baum, Warren D. Smith
Propagating Distributions Up Directed Acyclic Graphs. Neural Comput. 11 (1) (1999)
Satish Rao, Warren D. Smith
Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC (1998)
Eric B. Baum, Warren D. Smith
A Bayesian approach to relevance in game playing. J. Int. Comput. Games Assoc. 21 (1) (1998)
Warren D. Smith, Nicholas C. Wormald
Geometric Separator Theorems & Applications. FOCS (1998)
Eric B. Baum, Warren D. Smith
A Bayesian Approach to Relevance in Game Playing. Artif. Intell. 97 (1-2) (1997)
Ding-Zhu Du, Warren D. Smith
Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions. J. Comb. Theory, Ser. A 74 (1) (1996)
Michael B. Dillencourt, Warren D. Smith
Graph-theoretical conditions for inscribability and Delaunay realizability. Discret. Math. 161 (1-3) (1996)
Andrew M. Odlyzko, Warren D. Smith
Nonabelian sets with distinct k-sums. Discret. Math. 146 (1-3) (1995)
Warren D. Smith, J. MacGregor Smith
On the Steiner Ratio in 3-Space. J. Comb. Theory, Ser. A 69 (2) (1995)
Michael B. Dillencourt, Warren D. Smith
A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geom. Appl. 5 (1995)
Warren D. Smith
DNA computers in vitro and vivo. DNA Based Computers (1995)
Michael B. Dillencourt, Warren D. Smith
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG (1994)
Serge A. Plotkin, Satish Rao, Warren D. Smith
Shallow Excluded Minors and Improved Graph Decompositions. SODA (1994)
Michael B. Dillencourt, Warren D. Smith
A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP (1993)
Kevin J. Lang, Warren D. Smith
A Test Suite for Chess Programs. J. Int. Comput. Games Assoc. 16 (3) (1993)
Warren D. Smith
How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica 7 (2&3) (1992)
Warren D. Smith, Peter W. Shor
Steiner Tree Problems. Algorithmica 7 (2&3) (1992)
Michael B. Dillencourt, Warren D. Smith
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. SCG (1992)
Steven Skiena, Warren D. Smith, Paul Lemke
Reconstructing Sets from Interpoint Distances (Extended Abstract). SCG (1990)
Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith
A new table of constant weight codes. IEEE Trans. Inf. Theory 36 (6) (1990)