William P. Thurston

According to our database, William P. Thurston authored at least 11 papers between 1981 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2006

The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs.

T. R. Riley, William P. Thurston

Electron. J. Comb., 2006

2003

The Size of Spanning Disks for Polygonal Curves.

Joel Hass, Jack Snoeyink, William P. Thurston

Discret. Comput. Geom., 2003

2002

3-manifold knot genus is NP-complet.

Ian Agol, Joel Hass, William P. Thurston

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

3-MANIFOLD KNOT GENUS is NP-complete.

Ian Agol, Joel Hass, William P. Thurston

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

1998

Geometric Separators for Finite-Element Meshes.

Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis

SIAM J. Sci. Comput., 1998

1997

Separators for sphere-packings and nearest neighbor graphs.

Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis

J. ACM, 1997

1992

Short Encodings of Evolving Structures.

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston

SIAM J. Discret. Math., 1992

1990

Contour tracing by piecewise linear approximations.

David P. Dobkin, Allan R. Wilks, Silvio V. F. Levy, William P. Thurston

ACM Trans. Graph., 1990

Separators in Two and Three Dimensions

Gary L. Miller, William P. Thurston

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1986

Rotation Distance, Triangulations, and Hyperbolic Geometry

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1981

The Challenge of Testing VLSI in the 1980's.

William P. Thurston

Proceedings of the Proceedings International Test Conference 1981, 1981