Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Warren D. Smith
2010 – today
- 2013
[j14]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White: Testing Closeness of Discrete Distributions. J. ACM 60(1): 4 (2013)- 2010
- [j13]Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson: Linear-time nearest point algorithms for coxeter lattices. IEEE Transactions on Information 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
- [i1]Warren D. Smith: 1. AES seems weak. 2. Linear time secure cryptography. IACR Cryptology ePrint Archive 2007: 248 (2007)
- 2006
- [j12]Warren D. Smith: Church's thesis meets the N-body problem. Applied Mathematics and Computation 178(1): 154-183 (2006)
- [j11]Warren D. Smith: Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks. Applied Mathematics and Computation 178(1): 184-193 (2006)
- 2000
- [j10]Warren D. Smith: A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. Eur. J. Comb. 21(1): 131-137 (2000)
- [c8]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White: Testing that distributions are close. FOCS 2000: 259-269
1990 – 1999
- 1999
- [j9]Eric B. Baum, Warren D. Smith: Propagating Distributions Up Directed Acyclic Graphs. Neural Computation 11(1): 215-227 (1999)
- 1998
- [c7]Warren D. Smith, Nicholas C. Wormald: Geometric Separator Theorems & Applications. FOCS 1998: 232-243
- [c6]Satish Rao, Warren D. Smith: Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC 1998: 540-550
- 1997
- [j8]Eric B. Baum, Warren D. Smith: A Bayesian Approach to Relevance in Game Playing. Artif. Intell. 97(1-2): 195-242 (1997)
- 1996
- [j7]Michael B. Dillencourt, Warren D. Smith: Graph-theoretical conditions for inscribability and Delaunay realizability. Discrete Mathematics 161(1-3): 63-77 (1996)
- [j6]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): 115-130 (1996)
- 1995
- [j5]Michael B. Dillencourt, Warren D. Smith: A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geometry Appl. 5: 21-36 (1995)
- [j4]Warren D. Smith, J. MacGregor Smith: On the Steiner Ratio in 3-Space. J. Comb. Theory, Ser. A 69(2): 301-332 (1995)
- 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
- [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]
- [c2]Michael B. Dillencourt, Warren D. Smith: A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. Symposium on Computational Geometry 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 Transactions on Information Theory 36(6): 1334-1380 (1990)
- [c1]Steven Skiena, Warren D. Smith, Paul Lemke: Reconstructing Sets from Interpoint Distances (Extended Abstract). Symposium on Computational Geometry 1990: 332-339
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-13 19:53 CET by the dblp team