| 2025 | WSC | A Simulation Optimization Approach to Optimal Experimental Design for Symbolic Discovery. | Kenneth L. Clarkson, Soumyadip Ghosh, Joao P. Goncalves, Rik Sengupta, Mark S. Squillante, Dmitry Zubarev |
| 2024 | ICLR | Topological data analysis on noisy quantum computers. | Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L. Clarkson, Mark S. Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, Lior Horesh |
| 2022 | ICML | Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. | Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, Honghao Lin, David P. Woodruff |
| 2022 | SODA | Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. | Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff |
| 2022 | STOC | Low-rank approximation with | Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff |
| 2021 | ICASSP | Sparse Graph Based Sketching for Fast Numerical Linear Algebra. | Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis |
| 2021 | ICML | Projection techniques to update the truncated SVD of evolving matrices with applications. | Vasileios Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson |
| 2019 | COLT | Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. | Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth |
| 2019 | ICML | Dimensionality Reduction for Tukey Regression. | Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff |
| 2018 | MICCAI | Hashing-Based Atlas Ranking and Selection for Multiple-Atlas Segmentation. | Amin Katouzian, Hongzhi Wang, Sailesh Conjeti, Hui Tang, Ehsan Dehghan, Alexandros Karargyris, Anup Pillai, Kenneth L. Clarkson, Nassir Navab |
| 2017 | SODA | Low-Rank PSD Approximation in Input-Sparsity Time. | Kenneth L. Clarkson, David P. Woodruff |
| 2015 | FOCS | Input Sparsity and Hardness for Robust Subspace Approximation. | Kenneth L. Clarkson, David P. Woodruff |
| 2015 | SODA | Sketching for | Kenneth L. Clarkson, David P. Woodruff |
| 2013 | SODA | The Fast Cauchy Transform and Faster Robust Linear Regression. | Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff |
| 2013 | STOC | Low rank approximation and regression in input sparsity time. | Kenneth L. Clarkson, David P. Woodruff |
| 2010 | FOCS | Sublinear Optimization for Machine Learning. | Kenneth L. Clarkson, Elad Hazan, David P. Woodruff |
| 2010 | ICDE | Schema covering: a step towards enabling reuse in information integration. | Barna Saha, Ioana Stanoi, Kenneth L. Clarkson |
| 2010 | SODA | Self-improving Algorithms for Convex Hulls. | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri |
| 2009 | STOC | Numerical linear algebra in the streaming model. | Kenneth L. Clarkson, David P. Woodruff |
| 2008 | SODA | Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. | Kenneth L. Clarkson |
| 2007 | VTC | Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. | Kenneth L. Clarkson, John D. Hobby |
| 2007 | VTC | Modeling UpLink Power Control with Outage Probabilities. | Kenneth L. Clarkson, Georg K. Hampel, John D. Hobby |
| 2006 | STOC | Building triangulations using epsilon-nets. | Kenneth L. Clarkson |
| 2003 | SODA | Smaller core-sets for balls. | Mihai Badoiu, Kenneth L. Clarkson |
| 1997 | STOC | Nearest Neighbor Queries in Metric Spaces. | Kenneth L. Clarkson |
| 1994 | FOCS | More Output-Sensitive Geometric Algorithms (Extended Abstract) | Kenneth L. Clarkson |
| 1993 | WADS | Algorithms for Polytope Covering and Approximation. | Kenneth L. Clarkson |
| 1992 | FOCS | Safe and Effective Determinant Evaluation | Kenneth L. Clarkson |
| 1992 | STACS | Four Results on Randomized Incremental Constructions. | Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel |
| 1991 | SODA | Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. | Kenneth L. Clarkson |
| 1990 | SODA | Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. | Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine |
| 1988 | FOCS | A Las Vegas Algorithm for Linear Programming When the Dimension Is Small | Kenneth L. Clarkson |
| 1988 | FOCS | Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
| 1987 | STOC | Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) | Kenneth L. Clarkson |
| 1986 | STOC | Further Applications of Random Sampling to Computational Geometry | Kenneth L. Clarkson |
| 1985 | STOC | A Probabilistic Algorithm for the Post Office Problem | Kenneth L. Clarkson |
| 1984 | STOC | Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) | Kenneth L. Clarkson |
| 1983 | FOCS | Fast Algorithms for the All Nearest Neighbors Problem | Kenneth L. Clarkson |