Kenneth L. Clarkson

	2009
57		Kenneth L. Clarkson, David P. Woodruff: Numerical linear algebra in the streaming model. STOC 2009: 205-214
56		Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350
55		Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms CoRR abs/0907.0884: (2009)
54		Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the Set Multi-Cover Problem in Geometric Settings CoRR abs/0909.0537: (2009)
	2008
53		Kenneth L. Clarkson: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. SODA 2008: 922-931
52		Kenneth L. Clarkson, C. Seshadhri: Self-improving algorithms for delaunay triangulations. Symposium on Computational Geometry 2008: 148-155
51		Kenneth L. Clarkson: Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. Symposium on Computational Geometry 2008: 305
50		Kenneth L. Clarkson: Tighter bounds for random projections of manifolds. Symposium on Computational Geometry 2008: 39-48
49		Mihai Badoiu, Kenneth L. Clarkson: Optimal core-sets for balls. Comput. Geom. 40(1): 14-22 (2008)
	2007
48		Kenneth L. Clarkson, K. Georg Hampel, John D. Hobby: Modeling UpLink Power Control with Outage Probabilities. VTC Fall 2007: 799-803
47		Kenneth L. Clarkson, John D. Hobby: Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. VTC Fall 2007: 905-909
46		Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover. Discrete & Computational Geometry 37(1): 43-58 (2007)
	2006
45		Kenneth L. Clarkson: Building triangulations using epsilon-nets. STOC 2006: 326-335
	2005
44		Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved approximation algorithms for geometric set cover. Symposium on Computational Geometry 2005: 135-141
43		Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover CoRR abs/cs/0501045: (2005)
	2003
42		Mihai Badoiu, Kenneth L. Clarkson: Smaller core-sets for balls. SODA 2003: 801-802
41		Simon C. Borst, Kenneth L. Clarkson, John M. Graybeal, Harish Viswanathan, Philip A. Whiting: User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems. Bell Labs Technical Journal 8(2): 33-47 (2003)
	1999
40		Kenneth L. Clarkson: Nearest Neighbor Queries in Metric Spaces. Discrete & Computational Geometry 22(1): 63-93 (1999)
39		Kenneth L. Clarkson: Guest Editor's Foreword. Discrete & Computational Geometry 22(4): 479-480 (1999)
	1998
38		Kenneth L. Clarkson: SODA '95 Papers. J. Algorithms 29(2): 203 (1998)
	1997
37		Kenneth L. Clarkson: Nearest Neighbor Queries in Metric Spaces. STOC 1997: 609-617
	1996
36		Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating center points with iterative Radon points. Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996)
	1995
35		Kenneth L. Clarkson: Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. J. ACM 42(2): 488-499 (1995)
	1994
34		Kenneth L. Clarkson: More Output-Sensitive Geometric Algorithms (Extended Abstract) FOCS 1994: 695-702
33		Kenneth L. Clarkson: An Algorithm for Approximate Closest-Point Queries. Symposium on Computational Geometry 1994: 160-164
	1993
32		Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating Center Points with Iterated Radon Points. Symposium on Computational Geometry 1993: 91-98
31		Kenneth L. Clarkson: Algorithms for Polytope Covering and Approximation. WADS 1993: 246-252
30		Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine: Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Algorithmica 9(2): 168-183 (1993)
29		Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)
28		Kenneth L. Clarkson: A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. Discrete & Computational Geometry 10: 427-433 (1993)
	1992
27		Kenneth L. Clarkson: Safe and Effective Determinant Evaluation FOCS 1992: 387-395
26		Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474
25		Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geometry Appl. 2(2): 117-133 (1992)
24		Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geometry Appl. 2(3): 341-343 (1992)
	1991
23		Kenneth L. Clarkson: Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. SODA 1991: 17-23
22		Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Randomized Parallel Algorithms for Trapezoidal Diagrams. Symposium on Computational Geometry 1991: 152-161
	1990
21		Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine: Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA 1990: 179-187
20		Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discrete & Computational Geometry 5: 99-160 (1990)
	1989
19		Kenneth L. Clarkson: An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica 4(4): 461-469 (1989)
18		Kenneth L. Clarkson, Peter W. Shor: Application of Random Sampling in Computational Geometry, II. Discrete & Computational Geometry 4: 387-421 (1989)
17		Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk: A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discrete & Computational Geometry 4: 423-432 (1989)
	1988
16		Kenneth L. Clarkson: A Las Vegas Algorithm for Linear Programming When the Dimension Is Small FOCS 1988: 452-456
15		Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS 1988: 568-579
14		Kenneth L. Clarkson: Applications of Random Sampling in Computational Geometry, II. Symposium on Computational Geometry 1988: 1-11
13		Kenneth L. Clarkson, Peter W. Shor: Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. Symposium on Computational Geometry 1988: 12-17
12		Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk: A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Symposium on Computational Geometry 1988: 18-22
11		Kenneth L. Clarkson: A Randomized Algorithm for Closest-Point Queries. SIAM J. Comput. 17(4): 830-847 (1988)
	1987
10		Kenneth L. Clarkson: Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) STOC 1987: 56-65
9		Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya: Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. Symposium on Computational Geometry 1987: 251-257
8		Kenneth L. Clarkson: New Applications of random Sampling in Computational Geometry. Discrete & Computational Geometry 2: 195-222 (1987)
7		Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson: Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. Theor. Comput. Sci. 49: 81-84 (1987)
	1986
6		Kenneth L. Clarkson: Further Applications of Random Sampling to Computational Geometry STOC 1986: 414-423
5		Kenneth L. Clarkson: Linear Programming in O(n * (3_d)_2) Time. Inf. Process. Lett. 22(1): 21-24 (1986)
	1985
4		Kenneth L. Clarkson: A Probabilistic Algorithm for the Post Office Problem STOC 1985: 175-184
	1984
3		Kenneth L. Clarkson: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) STOC 1984: 342-348
	1983
2		Kenneth L. Clarkson: Fast Algorithms for the All Nearest Neighbors Problem FOCS 1983: 226-232
1		Kenneth L. Clarkson: A Modification of the Greedy Algorithm for Vertex Cover. Inf. Process. Lett. 16(1): 23-25 (1983)

Coauthor Index

1	Nir Ailon	[55]
2	Mihai Badoiu	[42] [49]
3	Jon Louis Bentley	[21] [30]
4	Sem C. Borst (Simon C. Borst)	[41]
5	Bernard Chazelle	[55]
6	Chandra Chekuri	[54] [56]
7	Richard Cole	[22] [24] [25]
8	Herbert Edelsbrunner	[15] [20]
9	David Eppstein	[32] [36]
10	John M. Graybeal	[41]
11	Leonidas J. Guibas	[7] [15] [20]
12	K. Georg Hampel	[48]
13	Sariel Har-Peled	[54] [56]
14	John D. Hobby	[47] [48]
15	Sanjiv Kapoor	[9]
16	David B. Levine	[21] [30]
17	Ding Liu	[55]
18	Kurt Mehlhorn	[26] [29]
19	Gary L. Miller	[32] [36]
20	Wolfgang Mulzer (Wolfgang Johann Heinrich Mulzer)	[55]
21	Raimund Seidel	[26] [29]
22	C. Seshadhri	[52] [55]
23	Micha Sharir	[15] [20]
24	Peter W. Shor	[13] [18]
25	Jorge Stolfi	[7]
26	Carl Sturtivant	[32] [36]
27	Robert Endre Tarjan	[12] [17] [22] [24] [25]
28	Shang-Hua Teng	[32] [36]
29	Pravin M. Vaidya	[9]
30	Kasturi R. Varadarajan	[43] [44] [46]
31	Harish Viswanathan	[41]
32	Emo Welzl	[15] [20]
33	Philip A. Whiting	[41]
34	David P. Woodruff	[57]
35	Christopher J. Van Wyk	[12] [17]

Colors in the list of coauthors