Jeffrey C. Lagarias: Knot theory papers

• The Computational Complexity of Knot and Link Problems. (Preliminary Version)
  Joel Hass, Jeffrey C. Lagarias and Nicholas Pippenger,
  Proc. 38th Annual Symposium on Foundations of Computer Science , IEEE Press 1997, pp. 172-181. [PostScript]

• The Computational Complexity of Knot and Link Problems
  Joel Hass, Jeffrey C. Lagarias and Nick Pippenger,
  J. A. C. M. 46 (1999), 185--211 . [PostScript]

• The number of Reidemeister moves needed for unknotting ,
  Joel Hass and Jeffrey C. Lagarias,
  J. Amer. Math. Soc., 14 (2001), 399--428. . [PostScript]

• The minimal number of triangles needed to span a polygon embedded in R^d ,
  Joel Hass and J. C. Lagarias,
  in: Discrete and Computational Geometry: The Goodman-Pollack Festschrift
  (B. Aronov, S. Basu, J. Pach, and M. Sharir, Eds), Springer-Verlag: New York 2003, pp. 509--526 . [PostScript]

• Area inequalities for embedded disks spanning unknotted curves ,
  J. Hass, J. C. Lagarias and W. P. Thurston,
  preprint . [PostScript]