Kenneth L. Clarkson

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 31

Top Venues

CoRR

SODA

ICML

Discret. Comput. Geom.

Publications

Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L. Clarkson, Mark S. Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, Lior Horesh
Topological data analysis on noisy quantum computers. ICLR (2024)
Kenneth L. Clarkson, Shashanka Ubaru, Elizabeth Yang
Capacity Analysis of Vector Symbolic Architectures. CoRR (2023)
Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L. Clarkson, Mark S. Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, Lior Horesh
Towards Quantum Advantage on Noisy Quantum Computers. CoRR (2022)
Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo
Bayesian Experimental Design for Symbolic Discovery. CoRR (2022)
Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff
Matrix-Vector Products. CoRR (2022)
Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, Honghao Lin, David P. Woodruff
Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. ICML (2022)
Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff
matrix-vector products. STOC (2022)
Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. SODA (2022)
Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis
Sparse Graph Based Sketching for Fast Numerical Linear Algebra. ICASSP (2021)
Shashanka Ubaru, Ismail Yunus Akhalwaya, Mark S. Squillante, Kenneth L. Clarkson, Lior Horesh
Quantum Topological Data Analysis with Linear Depth and Exponential Speedup. CoRR (2021)
Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. CoRR (2021)
Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh
Integration of Data and Theory for Accelerated Derivable Symbolic Discovery. CoRR (2021)
Kenneth L. Clarkson, Sanjana Sahayaraj
Order Embeddings from Merged Ontologies using Sketching. CoRR (2021)
Vasileios Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson
Projection techniques to update the truncated SVD of evolving matrices with applications. ICML (2021)
Michael Boratko, Dongxu Zhang, Nicholas Monath, Luke Vilnis, Kenneth L. Clarkson, Andrew McCallum
Capacity and Bias of Learned Geometric Embeddings for Directed Graphs. NeurIPS (2021)
Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis
Sparse graph based sketching for fast numerical linear algebra. CoRR (2021)
Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, David P. Woodruff
Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. CoRR (2020)
Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák
Random Sampling with Removal. Discret. Comput. Geom. 64 (3) (2020)
Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson
Projection techniques to update the truncated SVD of evolving matrices. CoRR (2020)
Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff
Dimensionality Reduction for Tukey Regression. CoRR (2019)
Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. COLT (2019)
Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. CoRR (2019)
Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff
Dimensionality Reduction for Tukey Regression. ICML (2019)
Stephen Boyer, Thomas D. Griffin, Sarath Swaminathan, Kenneth L. Clarkson, Dmitry Zubarev
Data Infrastructure and Approaches for Ontology-Based Drug Repurposing. CoRR (2018)
Haim Avron, Kenneth L. Clarkson, David P. Woodruff
Faster Kernel Ridge Regression Using Sketching and Preconditioning. SIAM J. Matrix Anal. Appl. 38 (4) (2017)
Kenneth L. Clarkson, David P. Woodruff
Low-Rank PSD Approximation in Input-Sparsity Time. SODA (2017)
Haim Avron, Kenneth L. Clarkson, David P. Woodruff
Sharper Bounds for Regularized Data Fitting. APPROX-RANDOM (2017)
Haim Avron, Kenneth L. Clarkson, David P. Woodruff
Faster Kernel Ridge Regression Using Sketching and Preconditioning. CoRR (2016)
Kenneth L. Clarkson, János Pach, Günter M. Ziegler
Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. 55 (4) (2016)
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. SIAM J. Comput. 45 (3) (2016)
Haim Avron, Kenneth L. Clarkson, David P. Woodruff
Sharper Bounds for Regression and Low-Rank Approximation with Regularization. CoRR (2016)
Kenneth L. Clarkson, David P. Woodruff
Input Sparsity and Hardness for Robust Subspace Approximation. CoRR (2015)
Kenneth L. Clarkson, David P. Woodruff
-Estimators: A Unified Approach to Robust Regression. SODA (2015)
Kenneth L. Clarkson, David P. Woodruff
Input Sparsity and Hardness for Robust Subspace Approximation. FOCS (2015)
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. 43 (2) (2014)
Kenneth L. Clarkson, David P. Woodruff
Low rank approximation and regression in input sparsity time. STOC (2013)
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)
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Self-improving algorithms for coordinate-wise maxima. SCG (2012)
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls CoRR (2012)
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
Sublinear optimization for machine learning. J. ACM 59 (5) (2012)
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. Comput. Phys. Commun. 183 (8) (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 (2012)
Kenneth L. Clarkson, David P. Woodruff
Low Rank Approximation and Regression in Input Sparsity Time CoRR (2012)
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Self-improving Algorithms for Coordinate-wise Maxima CoRR (2012)
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
On the set multicover problem in geometric settings. ACM Trans. Algorithms 9 (1) (2012)
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
Self-Improving Algorithms. SIAM J. Comput. 40 (2) (2011)
Barna Saha, Ioana Stanoi, Kenneth L. Clarkson
Schema covering: a step towards enabling reuse in information integration. ICDE (2010)
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
Sublinear Optimization for Machine Learning CoRR (2010)
Kenneth L. Clarkson
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms 6 (4) (2010)
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Self-improving Algorithms for Convex Hulls. SODA (2010)
Kenneth L. Clarkson, Günter Rote
Welcome from the Editors-in-Chief. J. Comput. Geom. 1 (1) (2010)
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
Sublinear Optimization for Machine Learning. FOCS (2010)
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
Self-Improving Algorithms CoRR (2009)
Kenneth L. Clarkson, David P. Woodruff
Numerical linear algebra in the streaming model. STOC (2009)
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
On the Set Multi-Cover Problem in Geometric Settings CoRR (2009)
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
On the set multi-cover problem in geometric settings. SCG (2009)
Kenneth L. Clarkson, C. Seshadhri
Self-improving algorithms for delaunay triangulations. SCG (2008)
Mihai Badoiu, Kenneth L. Clarkson
Optimal core-sets for balls. Comput. Geom. 40 (1) (2008)
Kenneth L. Clarkson
Tighter bounds for random projections of manifolds. SCG (2008)
Kenneth L. Clarkson
Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. SCG (2008)
Kenneth L. Clarkson
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. SODA (2008)
Kenneth L. Clarkson, Georg K. Hampel, John D. Hobby
Modeling UpLink Power Control with Outage Probabilities. VTC Fall (2007)
Kenneth L. Clarkson, John D. Hobby
Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. VTC Fall (2007)
Kenneth L. Clarkson, Kasturi R. Varadarajan
Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. 37 (1) (2007)
Kenneth L. Clarkson
Building triangulations using epsilon-nets. STOC (2006)
Kenneth L. Clarkson, Kasturi R. Varadarajan
Improved approximation algorithms for geometric set cover. SCG (2005)
Kenneth L. Clarkson, Kasturi R. Varadarajan
Improved Approximation Algorithms for Geometric Set Cover CoRR (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 Tech. J. 8 (2) (2003)
Mihai Badoiu, Kenneth L. Clarkson
Smaller core-sets for balls. SODA (2003)
Kenneth L. Clarkson, Wim Sweldens, Alice Zheng
Fast multiple-antenna differential decoding. IEEE Trans. Commun. 49 (2) (2001)
Kenneth L. Clarkson
Guest Editor's Foreword. Discret. Comput. Geom. 22 (4) (1999)
Kenneth L. Clarkson
Nearest Neighbor Queries in Metric Spaces. Discret. Comput. Geom. 22 (1) (1999)
Kenneth L. Clarkson
SODA '95 Papers. J. Algorithms 29 (2) (1998)
Kenneth L. Clarkson
Nearest Neighbor Queries in Metric Spaces. STOC (1997)
Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6 (3) (1996)
Kenneth L. Clarkson
Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. J. ACM 42 (2) (1995)
Kenneth L. Clarkson
More Output-Sensitive Geometric Algorithms (Extended Abstract) FOCS (1994)
Kenneth L. Clarkson
An Algorithm for Approximate Closest-Point Queries. SCG (1994)
Kenneth L. Clarkson
A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. Discret. Comput. Geom. 10 (1993)
Kenneth L. Clarkson
Algorithms for Polytope Covering and Approximation. WADS (1993)
Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Algorithmica 9 (2) (1993)
Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating Center Points with Iterated Radon Points. SCG (1993)
Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
Four Results on Randomized Incremental Constructions. Comput. Geom. 3 (1993)
Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2 (3) (1992)
Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2 (2) (1992)
Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
Four Results on Randomized Incremental Constructions. STACS (1992)
Kenneth L. Clarkson
Safe and Effective Determinant Evaluation FOCS (1992)
Kenneth L. Clarkson
Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. SODA (1991)
Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG (1991)
Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5 (1990)
Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA (1990)
Kenneth L. Clarkson
An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica 4 (4) (1989)
Kenneth L. Clarkson, Peter W. Shor
Application of Random Sampling in Computational Geometry, II. Discret. Comput. Geom. 4 (1989)
Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discret. Comput. Geom. 4 (1989)
Kenneth L. Clarkson
A Las Vegas Algorithm for Linear Programming When the Dimension Is Small FOCS (1988)
Kenneth L. Clarkson
A Randomized Algorithm for Closest-Point Queries. SIAM J. Comput. 17 (4) (1988)
Kenneth L. Clarkson, Peter W. Shor
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. SCG (1988)
Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS (1988)
Kenneth L. Clarkson
Applications of Random Sampling in Computational Geometry, II. SCG (1988)
Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. SCG (1988)

Kenneth L. Clarkson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kenneth L. Clarkson