default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWarren D. Smith
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j18]Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith:
Probabilistic lower bounds on maximal determinants of binary matrices. Australas. J Comb. 66: 350-364 (2016)- 2014
- [i4]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: 670 (2014) - 2013
- [j17]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. J. ACM 60(1): 4:1-4:25 (2013) - 2012
- [c12]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: 1570-1573 - 2011
- [c11]Warren D. Smith, Michael E. Nave, Alan P. Hreljac:
Tetherless ergonomics workstation to assess nurses' physical workload in a clinical setting. EMBC 2011: 5633-5636 - 2010
- [j16]Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson:
Linear-time nearest point algorithms for coxeter lattices. IEEE Trans. Inf. Theory 56(3): 1015-1022 (2010) - [i3]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. CoRR abs/1009.5397 (2010)
2000 – 2009
- 2009
- [i2]Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson:
Linear-time nearest point algorithms for Coxeter lattices. CoRR abs/0903.0673 (2009) - 2007
- [c10]Warren D. Smith:
Three Voting Protocols: ThreeBallot, VAV, and Twin. EVT 2007 - [i1]Warren D. Smith:
1. AES seems weak. 2. Linear time secure cryptography. IACR Cryptol. ePrint Arch. 2007: 248 (2007) - 2006
- [j15]Warren D. Smith:
Church's thesis meets the N-body problem. Appl. Math. Comput. 178(1): 154-183 (2006) - [j14]Warren D. Smith:
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks. Appl. Math. Comput. 178(1): 184-193 (2006) - 2000
- [j13]Warren D. Smith:
A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. Eur. J. Comb. 21(1): 131-137 (2000) - [c9]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing that distributions are close. FOCS 2000: 259-269
1990 – 1999
- 1999
- [j12]Eric B. Baum, Warren D. Smith:
Propagating Distributions Up Directed Acyclic Graphs. Neural Comput. 11(1): 215-227 (1999) - 1998
- [j11]Eric B. Baum, Warren D. Smith:
A Bayesian approach to relevance in game playing. J. Int. Comput. Games Assoc. 21(1): 43 (1998) - [c8]Warren D. Smith, Nicholas C. Wormald:
Geometric Separator Theorems & Applications. FOCS 1998: 232-243 - [c7]Satish Rao, Warren D. Smith:
Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC 1998: 540-550 - 1997
- [j10]Eric B. Baum, Warren D. Smith:
A Bayesian Approach to Relevance in Game Playing. Artif. Intell. 97(1-2): 195-242 (1997) - 1996
- [j9]Michael B. Dillencourt, Warren D. Smith:
Graph-theoretical conditions for inscribability and Delaunay realizability. Discret. Math. 161(1-3): 63-77 (1996) - [j8]Ding-Zhu Du, Warren D. Smith:
Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions. J. Comb. Theory A 74(1): 115-130 (1996) - 1995
- [j7]Andrew M. Odlyzko, Warren D. Smith:
Nonabelian sets with distinct k-sums. Discret. Math. 146(1-3): 169-177 (1995) - [j6]Michael B. Dillencourt, Warren D. Smith:
A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geom. Appl. 5: 21-36 (1995) - [j5]Warren D. Smith, J. MacGregor Smith:
On the Steiner Ratio in 3-Space. J. Comb. Theory A 69(2): 301-332 (1995) - [c6]Warren D. Smith:
DNA computers in vitro and vivo. DNA Based Computers 1995: 121-185 - 1994
- [c5]Michael B. Dillencourt, Warren D. Smith:
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292 - [c4]Serge A. Plotkin, Satish Rao, Warren D. Smith:
Shallow Excluded Minors and Improved Graph Decompositions. SODA 1994: 462-470 - 1993
- [j4]Kevin J. Lang, Warren D. Smith:
A Test Suite for Chess Programs. J. Int. Comput. Games Assoc. 16(3): 152-161 (1993) - [c3]Michael B. Dillencourt, Warren D. Smith:
A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP 1993: 177-188 - 1992
- [j3]Warren D. Smith:
How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica 7(2&3): 137-177 (1992) - [j2]Warren D. Smith, Peter W. Shor:
Steiner Tree Problems. Algorithmica 7(2&3): 329-332 (1992) - [c2]Michael B. Dillencourt, Warren D. Smith:
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. SCG 1992: 177-185 - 1990
- [j1]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): 1334-1380 (1990) - [c1]Steven Skiena, Warren D. Smith, Paul Lemke:
Reconstructing Sets from Interpoint Distances (Extended Abstract). SCG 1990: 332-339
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
