The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Warren D. Smith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael B. Dillencourt, Warren D. Smith
    Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:287-292 [Conf]
  2. Michael B. Dillencourt, Warren D. Smith
    A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:177-185 [Conf]
  3. Steven Skiena, Warren D. Smith, Paul Lemke
    Reconstructing Sets from Interpoint Distances (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:332-339 [Conf]
  4. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
    Testing that distributions are close. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:259-269 [Conf]
  5. Warren D. Smith, Nicholas C. Wormald
    Geometric Separator Theorems & Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:232-243 [Conf]
  6. Michael B. Dillencourt, Warren D. Smith
    A Simple Method for Resolving Degeneracies in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:177-188 [Conf]
  7. Serge A. Plotkin, Satish Rao, Warren D. Smith
    Shallow Excluded Minors and Improved Graph Decompositions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:462-470 [Conf]
  8. Satish Rao, Warren D. Smith
    Approximating Geometrical Graphs via "Spanners" and "Banyans". [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:540-550 [Conf]
  9. Eric B. Baum, Warren D. Smith
    A Bayesian Approach to Relevance in Game Playing. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:97, n:1-2, pp:195-242 [Journal]
  10. Warren D. Smith
    How To Find Steiner Minimal Trees in Euclidean d-Space. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:137-177 [Journal]
  11. Warren D. Smith, Peter W. Shor
    Steiner Tree Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:329-332 [Journal]
  12. Warren D. Smith
    A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:131-137 [Journal]
  13. Michael B. Dillencourt, Warren D. Smith
    A linear-time algorithm for testing the inscribability of trivalent polyhedra. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:21-36 [Journal]
  14. Ding-Zhu Du, Warren D. Smith
    Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:115-130 [Journal]
  15. Warren D. Smith, J. MacGregor Smith
    On the Steiner Ratio in 3-Space. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:69, n:2, pp:301-332 [Journal]
  16. Eric B. Baum, Warren D. Smith
    Propagating Distributions Up Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:1, pp:215-227 [Journal]
  17. Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith
    A new table of constant weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1334-1380 [Journal]
  18. Warren D. Smith
    Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:178, n:1, pp:184-193 [Journal]
  19. Warren D. Smith
    Church's thesis meets the N-body problem. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:178, n:1, pp:154-183 [Journal]
  20. Michael B. Dillencourt, Warren D. Smith
    Graph-theoretical conditions for inscribability and Delaunay realizability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:63-77 [Journal]

  21. Linear-time nearest point algorithms for Coxeter lattices [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002