Warren D. Smith

2009
21	EE	Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson: Linear-time nearest point algorithms for Coxeter lattices CoRR abs/0903.0673: (2009)
2006
20	EE	Warren D. Smith: Church's thesis meets the N-body problem. Applied Mathematics and Computation 178(1): 154-183 (2006)
19	EE	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
18		Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White: Testing that distributions are close. FOCS 2000: 259-269
17	EE	Warren D. Smith: A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes. Eur. J. Comb. 21(1): 131-137 (2000)
1999
16		Eric B. Baum, Warren D. Smith: Propagating Distributions Up Directed Acyclic Graphs. Neural Computation 11(1): 215-227 (1999)
1998
15	EE	Warren D. Smith, Nicholas C. Wormald: Geometric Separator Theorems & Applications. FOCS 1998: 232-243
14	EE	Satish Rao, Warren D. Smith: Approximating Geometrical Graphs via "Spanners" and "Banyans". STOC 1998: 540-550
1997
13	EE	Eric B. Baum, Warren D. Smith: A Bayesian Approach to Relevance in Game Playing. Artif. Intell. 97(1-2): 195-242 (1997)
1996
12	EE	Michael B. Dillencourt, Warren D. Smith: Graph-theoretical conditions for inscribability and Delaunay realizability. Discrete Mathematics 161(1-3): 63-77 (1996)
11	EE	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
10		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)
9		Warren D. Smith, J. MacGregor Smith: On the Steiner Ratio in 3-Space. J. Comb. Theory, Ser. A 69(2): 301-332 (1995)
1994
8		Michael B. Dillencourt, Warren D. Smith: Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292
7		Serge A. Plotkin, Satish Rao, Warren D. Smith: Shallow Excluded Minors and Improved Graph Decompositions. SODA 1994: 462-470
1993
6		Michael B. Dillencourt, Warren D. Smith: A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP 1993: 177-188
1992
5	EE	Michael B. Dillencourt, Warren D. Smith: A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. Symposium on Computational Geometry 1992: 177-185
4		Warren D. Smith: How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica 7(2&3): 137-177 (1992)
3		Warren D. Smith, Peter W. Shor: Steiner Tree Problems. Algorithmica 7(2&3): 329-332 (1992)
1990
2	EE	Steven Skiena, Warren D. Smith, Paul Lemke: Reconstructing Sets from Interpoint Distances (Extended Abstract). Symposium on Computational Geometry 1990: 332-339
1		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)

Coauthor Index

1	Tugkan Batu	[18]
2	Eric B. Baum	[13] [16]
3	Andries E. Brouwer	[1]
4	I. Vaughan L. Clarkson	[21]
5	Michael B. Dillencourt	[5] [6] [8] [10] [12]
6	Ding-Zhu Du	[11]
7	Lance Fortnow	[18]
8	Paul Lemke	[2]
9	Robby G. McKilliam	[21]
10	Serge A. Plotkin	[7]
11	Satish Rao	[7] [14]
12	Ronitt Rubinfeld	[18]
13	James B. Shearer	[1]
14	Peter W. Shor	[3]
15	Steven Skiena	[2]
16	Neil J. A. Sloane (N. J. A. Sloane)	[1]
17	James MacGregor Smith (J. MacGregor Smith)	[9]
18	Patrick White	[18]
19	Nicholas C. Wormald	[15]

Colors in the list of coauthors