Fourth Annual Symposium on Computational Geometry , Urbana, Illinois, June 1988. Fourth Annual Symposium on Computational Geometry , Urbana, Illinois, June 1988. An algorithm for geometric minimum spanning trees requiring nearly linear expected time. K. L.Clarkson, S.Kapoor, and P.Vaidya. Third Annual Symposium on Computational Geometry , Waterloo, Ontario, June 1987.
Approximation algorithms for shortest path motion planning .
A Randomized Parallel Algorithm for Weighted Vertex Cover . L. J.Guibas, J.Stolfi, and K. L.Clarkson. Solving related two and three dimensional linear programming problems in logarithmic time. K. L. Clarkson. New applications of random sampling to computational geometry .