bibliography clarkson
-
K. L. Clarkson,
Implementation of a Model of rm CO 2 Diffusion in the Midtroposphere,
Claremont CA,
1977,
Claremont Graduate School Technical Report.
-
K. L. Clarkson,
A Procedure for Camera Calibration,
Proceedings of the DARPA Image Understanding Workshop,
Maclean VA: Science Applications Inc.,
1981.
-
K. L. Clarkson,
Grammatical Inference,
Ed. P. Cohen and E. Feigenbaum (eds) and Kaufman Inc. W.,
The Handbook of Artificial Intelligence,
Vol. 3,
Los Altos CA,
1982.
-
K. L. Clarkson,
A Modification of the Greedy Algorithm for Vertex Cover,
Information Processing Letters,
Vol. 16,
pp. 23--25,
January 1983.
-
K. L. Clarkson,
Fast Algorithms for the All Nearest Neighbors Problem,
Proc. 24th Symp. on Foundations of Computer Science,
Tucson AZ,
November 1983.
-
K. L. Clarkson,
Fast Expected-time and Approximation Algorithms for Geometric Minimum Spanning Trees,
Proc. 16th Annual SIGACT Symposium,
Washington DC,
April 1984.
-
K. L. Clarkson,
Algorithms for Closest-point Problems,
Stanford University,
January 1985.
-
K. L. Clarkson,
A Randomized Algorithm for Closest-Point Queries,
pp. 830-847,
1985,
(Proc. 17th Annual SIGACT Symposium) ,
http: cm.bell-labs.com cm cs doc 88 2-po.ps.gz.
-
K. L. Clarkson,
Linear Programming in 0(n3 d 2 Time,
Information Processing Letters,
Vol. 22,
pp. 21--24,
January 1986.
-
K. L. Clarkson,
New Applications of Random Sampling to Computational Geometry,
Discrete and Computational Geometry,
Vol. 2,
pp. 195--222,
1986,
(Proc. 18th Annu. ACM Sympos. Theory Comput.) ,
http: cm.bell-labs.com cm cs doc 86 2-rs.ps.gz.
-
L. J. Guibas and J. Stolfi and K. L. Clarkson,
Solving Related Two and Three Dimensional Linear Programming Problems in Logarithmic Time,
Theoretical Computer Science,
Vol. 49,
pp. 81--84,
1987.
-
K. L. Clarkson,
Approximation Algorithms for Shortest Path Motion Planning,
Proc. 19th Annual SIGACT Symposium,
New York New York,
May 1987,
http: cm.bell-labs.com cm cs doc 87 2-mp.ps.gz.
-
K. L. Clarkson and S. Kapoor and P. Vaidya,
Rectilinear Shortest Paths through Polygonal Obstacles in O (n log 2 n) Time,
Proc. Third Annual Symposium on Computational Geometry,
Waterloo Ontario,
June 1987,
http: cm.bell-labs.com cm cs doc 87 2-l1mp.ps.gz.
-
K. L. Clarkson,
An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time,
Algorithmica,
Vol. 4,
pp. 461--469,
1989.
-
K. L. Clarkson,
Applications of Random Sampling in Computational Geometry II,
Proc. Fourth Annual Symposium on Computational Geometry,
Urbana Illinois,
June 1988.
-
K. L. Clarkson and P. W. Shor,
Algorithms for Diametral Pairs and Convex Hulls that are Optimal Randomized and Incremental.,
Proc. Fourth Annual Symposium on Computational Geometry,
Urbana Illinois,
June 1988.
-
K. L. Clarkson and P. W. Shor,
Applications of Random Sampling in Computational Geometry II,
Discrete and Computational Geometry,
Vol. 4,
1,
pp. 387--421,
1989,
((Merges two papers above.)) ,
http: cm.bell-labs.com cm cs doc 88 2-rs2m.ps.gz.
-
K. L. Clarkson and R. E. Tarjan and C. J. Van Wyk,
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon,
Discrete and Computational Geometry,
Vol. 4,
1,
pp. 423--432,
1988,
(Proc. Fourth Annual Symposium on Computational Geometry) .
-
K. L. Clarkson,
A L as V egas algorithm for linear programming when the dimension is small,
Proc. 29th Annual IEEE Symposium on Foundations of Computer Science,
pp. 452--456,
October 1988,
(Revised version: Las Vegas algorithms for linear and integer programming when the dimension is small to appear in em J. ACM em) ,
http: cm.bell-labs.com cm cs doc 2-lp2.ps.gz.
-
J. L. Bentley and K. L. Clarkson and D. B. Levine,
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls,
Algorithmica,
pp. 168-183,
1990,
(Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms) .
-
K. L. Clarkson and H. Edelsbrunner and L. Guibas and M. Sharir and E. Welzl,
Combinatorial complexity bounds for arrangements of curves and surfaces,
Discrete and Computational Geometry,
Vol. 5,
2,
pp. 99--160,
1988,
(Proc. 29th Annual IEEE Symposium on Foundations of Computer Science) .
-
K. L. Clarkson,
Approximation algorithms for planar traveling salesman tours and minimum-length triangulations,
Proc. Second ACM Symposium on Discrete Algorithms,
January 1991,
http: cm.bell-labs.com cm cs doc 91 2-tsp.ps.gz.
-
K. L. Clarkson and R. Cole and R. E. Tarjan,
Randomized parallel algorithms for trapezoidal diagrams,
Int. J. Comp. Geom. and Applications,
pp. 117-133,
1991,
(Proc. Seventh Annual Symposium on Computational Geometry) ,
http: cm.bell-labs.com cm cs doc 92 2-tri.ps.gz.
-
K. L. Clarkson and K. Mehlhorn and R. Seidel,
Four results on randomized incremental constructions,
Comp. Geom.: Theory and Applications,
pp. 185-121,
1992,
(Proc. Symp. Theor. Aspects of Comp. Sci.) ,
http: cm.bell-labs.com cm cs doc 93 2-4res.ps.gz.
-
K. L. Clarkson,
Randomized Geometric Algorithms,
Ed. F. K. Hwang and D. Z. Hu (eds) and World Scientific Publishing,
Computers and Euclidean Geometry,
1992,
http: cm.bell-labs.com cm cs doc 92 2-rga.ps.gz.
-
K. L. Clarkson,
A bound on local minima of arrangements that implies the upper bound theorem,
Discrete and Computational Geometry,
Vol. 10,
pp. 427--233,
1993,
http: cm.bell-labs.com cm cs doc 92 2-07.ps.gz.
-
K. L. Clarkson,
Safe and effective determinant evaluation,
Proc. 31st IEEE Symposium on Foundations of Computer Science,
pp. 387-395,
Pittsburgh PA,
October 1992,
http: cm.bell-labs.com cm cs doc 92 2-dets.ps.gz.
-
K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S. Teng,
Approximating center points with iterated Radon points,
Proceedings of the 9th acm Symposium on Computational Geometry,
San Diego CA,
1993,
to appear Internat. J. Comput. Geom. Appl.,
http: cm.bell-labs.com cm cs doc 93 2-12.ps.gz.
-
K. L. Clarkson,
Algorithms for polytope covering and approximation,
Proc. 3rd Workshop on Algorithms and Data Structures,
pp. 246--252,
1993.
-
K. L. Clarkson,
An algorithm for approximate closest-point queries,
Proc. Tenth Annual Symposium on Computational Geometry,
pp. 160-164,
1994.
-
K. L. Clarkson,
Algorithms for Polytope Covering and Approximation and for Approximate Closest-point Queries,
1994,
((Merges two papers above)) ,
http: cm.bell-labs.com cm cs doc 94 2-04.ps.gz.
-
K. L. Clarkson,
More output-sensitive geometric algorithms,
Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci.,
pp. 695--702,
(95.01 matousek smid) ,
http: cm.bell-labs.com cm cs doc 94 2-13.ps.gz.
-
K. L. Clarkson,
Nearest Neighbor Queries in Metric Spaces,
Proc. 29th Symp. Theory Comput.,
http: cm.bell-labs.com cm cs doc 97 4-1.ps.gz.
Go to the Computing Sciences
Research Center home page.
Modified: December, 1997.
Copyright © 1997
Lucent Technologies. All rights reserved.