Warren D. Smith - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2016

Probabilistic lower bounds on maximal determinants of binary matricesRichard P. Brent, Judy-anne H. Osborn, Warren D. Smith. ajc, 66:350-364, 2016. [doi]

2014

DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded HomomorphicityDhananjay S. Phatak, Qiang Tang, Alan T. Sherman, Warren D. Smith, Peter Y. A. Ryan, Konstantinos Kalpakis. iacr, 2014:670, 2014. [doi]

DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded HomomorphicityDhananjay S. Phatak, Qiang Tang, Alan T. Sherman, Warren D. Smith, Peter Y. A. Ryan, Konstantinos Kalpakis. iacr, 2014:670, 2014. [doi]

2013

Testing Closeness of Discrete DistributionsTugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White. JACM, 60(1):4, 2013. [doi]

2012

Novel method for quantitative assessment of physical workload of healthcare workers by a tetherless ergonomics workstationWarren D. Smith, Kamal A. Alharbi, Jeremy B. Dixon, Hind Reggad. embc 2012: 1570-1573 [doi]

2011

Tetherless ergonomics workstation to assess nurses' physical workload in a clinical settingWarren D. Smith, Michael E. Nave, Alan P. Hreljac. embc 2011: 5633-5636 [doi]

2010

Linear-time nearest point algorithms for coxeter latticesRobby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson. TIT, 56(3):1015-1022, 2010. [doi]

2007

1. AES seems weak. 2. Linear time secure cryptographyWarren D. Smith. iacr, 2007:248, 2007. [doi]

Three Voting Protocols: ThreeBallot, VAV, and TwinWarren D. Smith. uss 2007: [doi]

2006

Three counterexamples refuting Kieu s plan for quantum adiabatic hypercomputation ; and some uncomputable quantum mechanical tasksWarren D. Smith. amc, 178(1):184-193, 2006. [doi]

Church s thesis meets the N-body problemWarren D. Smith. amc, 178(1):154-183, 2006. [doi]

2000

Testing that distributions are closeTugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White. focs 2000: 259-269

A Lower Bound for the Simplexity of then-Cube via Hyperbolic VolumesWarren D. Smith. ejc, 21(1):131-137, 2000. [doi]

1999

Propagating Distributions Up Directed Acyclic GraphsEric B. Baum, Warren D. Smith. neco, 11(1):215-227, 1999.

1998

A Bayesian approach to relevance in game playingEric B. Baum, Warren D. Smith. icga, 21(1):43, 1998. [doi]

Approximating Geometrical Graphs via Spanners and Banyans Satish Rao, Warren D. Smith. stoc 1998: 540-550 [doi]

Geometric Separator Theorems & ApplicationsWarren D. Smith, Nicholas C. Wormald. focs 1998: 232-243 [doi]

1997

A Bayesian Approach to Relevance in Game PlayingEric B. Baum, Warren D. Smith. ai, 97(1-2):195-242, 1997. [doi]

1996

Graph-theoretical conditions for inscribability and Delaunay realizabilityMichael B. Dillencourt, Warren D. Smith. DM, 161(1-3):63-77, 1996. [doi]

Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More DimensionsDing-Zhu Du, Warren D. Smith. JCT, 74(1):115-130, 1996. [doi]

1995

A linear-time algorithm for testing the inscribability of trivalent polyhedraMichael B. Dillencourt, Warren D. Smith. ijcga, 5:21-36, 1995.

On the Steiner Ratio in 3-SpaceWarren D. Smith, J. MacGregor Smith. JCT, 69(2):301-332, 1995.

DNA computers in vitro and vivoWarren D. Smith. dimacs 1995: 121-186

1994

Graph-Theoretical Conditions for Inscribability and Delaunay RealizabilityMichael B. Dillencourt, Warren D. Smith. cccg 1994: 287-292

Shallow Excluded Minors and Improved Graph DecompositionsSerge A. Plotkin, Satish Rao, Warren D. Smith. soda 1994: 462-470

1993

A Simple Method for Resolving Degeneracies in Delaunay TriangulationsMichael B. Dillencourt, Warren D. Smith. icalp 1993: 177-188

A Test Suite for Chess ProgramsKevin J. Lang, Warren D. Smith. icga, 16(3):152-161, 1993. [doi]

1992

A Linear-Time Algorithm for Testing the Inscribability of Trivalent PolyhedraMichael B. Dillencourt, Warren D. Smith. compgeom 1992: 177-185 [doi]

How To Find Steiner Minimal Trees in Euclidean d-SpaceWarren D. Smith. algorithmica, 7(2&3):137-177, 1992.

Steiner Tree ProblemsWarren D. Smith, Peter W. Shor. algorithmica, 7(2&3):329-332, 1992.

1990

A new table of constant weight codesAndries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith. TIT, 36(6):1334-1380, 1990.

Reconstructing Sets from Interpoint Distances (Extended Abstract)Steven Skiena, Warren D. Smith, Paul Lemke. compgeom 1990: 332-339 [doi]

Sign in or sign up to see more results.

runs on WebDSL