Kenneth L. Clarkson

Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff: The Fast Cauchy Transform and Faster Robust Linear Regression. SODA 2013: 466-477

Jingjing Zheng, Steven L. Mielke, Kenneth L. Clarkson, Donald G. Truhlar: MSTor: A program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity. Computer Physics Communications 183(8): 1803-1812 (2012)

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear optimization for machine learning. J. ACM 59(5): 23 (2012)

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multicover problem in geometric settings. ACM Transactions on Algorithms 9(1): 9 (2012)

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving algorithms for coordinate-wise maxima. Symposium on Computational Geometry 2012: 277-286

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving Algorithms for Coordinate-wise Maxima. CoRR abs/1204.0824 (2012)

Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff: The Fast Cauchy Transform: with Applications to Basis Construction, Regression, and Subspace Approximation in L1. CoRR abs/1207.4684 (2012)

Kenneth L. Clarkson, David P. Woodruff: Low Rank Approximation and Regression in Input Sparsity Time. CoRR abs/1207.6365 (2012)

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls. CoRR abs/1211.0952 (2012)

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011)

Kenneth L. Clarkson, Micha Sharir: Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). General Books 2010, isbn 978-1-153-46242-6, pp. 1-49

Kenneth L. Clarkson, Günter Rote: Welcome from the Editors-in-Chief. JoCG 1(1): 1-2 (2010)

Kenneth L. Clarkson: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Transactions on Algorithms 6(4) (2010)

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. FOCS 2010: 449-457

Barna Saha, Ioana Stanoi, Kenneth L. Clarkson: Schema covering: a step towards enabling reuse in information integration. ICDE 2010: 285-296

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving Algorithms for Convex Hulls. SODA 2010: 1546-1565

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. CoRR abs/1010.4408 (2010)

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350

Kenneth L. Clarkson, David P. Woodruff: Numerical linear algebra in the streaming model. STOC 2009: 205-214

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms. CoRR abs/0907.0884 (2009)

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the Set Multi-Cover Problem in Geometric Settings. CoRR abs/0909.0537 (2009)

Mihai Badoiu, Kenneth L. Clarkson: Optimal core-sets for balls. Comput. Geom. 40(1): 14-22 (2008)

Kenneth L. Clarkson: Tighter bounds for random projections of manifolds. Symposium on Computational Geometry 2008: 39-48

Kenneth L. Clarkson, C. Seshadhri: Self-improving algorithms for delaunay triangulations. Symposium on Computational Geometry 2008: 148-155

Kenneth L. Clarkson: Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. Symposium on Computational Geometry 2008: 305

Kenneth L. Clarkson: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. SODA 2008: 922-931

Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover. Discrete & Computational Geometry 37(1): 43-58 (2007)

Kenneth L. Clarkson, K. Georg Hampel, John D. Hobby: Modeling UpLink Power Control with Outage Probabilities. VTC Fall 2007: 799-803

Kenneth L. Clarkson, John D. Hobby: Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. VTC Fall 2007: 905-909

Kenneth L. Clarkson: Building triangulations using epsilon-nets. STOC 2006: 326-335

Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved approximation algorithms for geometric set cover. Symposium on Computational Geometry 2005: 135-141

Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover. CoRR abs/cs/0501045 (2005)

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)

Mihai Badoiu, Kenneth L. Clarkson: Smaller core-sets for balls. SODA 2003: 801-802

Kenneth L. Clarkson, Wim Sweldens, Alice Zheng: Fast multiple-antenna differential decoding. IEEE Transactions on Communications 49(2): 253-261 (2001)

Kenneth L. Clarkson: Nearest Neighbor Queries in Metric Spaces. Discrete & Computational Geometry 22(1): 63-93 (1999)

Kenneth L. Clarkson: Guest Editor's Foreword. Discrete & Computational Geometry 22(4): 479-480 (1999)

Kenneth L. Clarkson: SODA '95 Papers. J. Algorithms 29(2): 203 (1998)

Kenneth L. Clarkson: Nearest Neighbor Queries in Metric Spaces. STOC 1997: 609-617

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)

Kenneth L. Clarkson: Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. J. ACM 42(2): 488-499 (1995)

Kenneth L. Clarkson (Ed.): Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1995. San Francisco, California. ACM/SIAM 1995, isbn 0-89871-349-8

Kenneth L. Clarkson: An Algorithm for Approximate Closest-Point Queries. Symposium on Computational Geometry 1994: 160-164

Kenneth L. Clarkson: More Output-Sensitive Geometric Algorithms (Extended Abstract). FOCS 1994: 695-702

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)

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)

Kenneth L. Clarkson: A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. Discrete & Computational Geometry 10: 427-433 (1993)

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

Kenneth L. Clarkson: Algorithms for Polytope Covering and Approximation. WADS 1993: 246-252

Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geometry Appl. 2(2): 117-133 (1992)

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)

Kenneth L. Clarkson: Safe and Effective Determinant Evaluation. FOCS 1992: 387-395

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474

Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Randomized Parallel Algorithms for Trapezoidal Diagrams. Symposium on Computational Geometry 1991: 152-161

Kenneth L. Clarkson: Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. SODA 1991: 17-23

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)

Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine: Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA 1990: 179-187

Kenneth L. Clarkson: An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica 4(4): 461-469 (1989)

Kenneth L. Clarkson, Peter W. Shor: Application of Random Sampling in Computational Geometry, II. Discrete & Computational Geometry 4: 387-421 (1989)

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)

Kenneth L. Clarkson: A Randomized Algorithm for Closest-Point Queries. SIAM J. Comput. 17(4): 830-847 (1988)

Kenneth L. Clarkson: Applications of Random Sampling in Computational Geometry, II. Symposium on Computational Geometry 1988: 1-11

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

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

Kenneth L. Clarkson: A Las Vegas Algorithm for Linear Programming When the Dimension Is Small. FOCS 1988: 452-456

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

Kenneth L. Clarkson: New Applications of random Sampling in Computational Geometry. Discrete & Computational Geometry 2: 195-222 (1987)

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)

Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya: Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)²) Time. Symposium on Computational Geometry 1987: 251-257

Kenneth L. Clarkson: Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract). STOC 1987: 56-65

Kenneth L. Clarkson: Linear Programming in O(n * (3_d)_2) Time. Inf. Process. Lett. 22(1): 21-24 (1986)

Kenneth L. Clarkson: Further Applications of Random Sampling to Computational Geometry. STOC 1986: 414-423

Kenneth L. Clarkson: A Probabilistic Algorithm for the Post Office Problem. STOC 1985: 175-184

Kenneth L. Clarkson: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract). STOC 1984: 342-348

Kenneth L. Clarkson: A Modification of the Greedy Algorithm for Vertex Cover. Inf. Process. Lett. 16(1): 23-25 (1983)

Kenneth L. Clarkson: Fast Algorithms for the All Nearest Neighbors Problem. FOCS 1983: 226-232