Kenneth L. Clarkson

According to our database, Kenneth L. Clarkson authored at least 94 papers between 1983 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Foreword.

Kenneth L. Clarkson, János Pach, Csaba D. Tóth

Discret. Comput. Geom., September, 2024

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

Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023

Capacity Analysis of Vector Symbolic Architectures.

Kenneth L. Clarkson, Shashanka Ubaru, Elizabeth Yang

CoRR, 2023

2022

Bayesian Experimental Design for Symbolic Discovery.

Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo

CoRR, 2022

Towards Quantum Advantage 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

CoRR, 2022

Low-Rank Approximation with 1/ε^1/3 Matrix-Vector Products.

Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff

CoRR, 2022

Low-rank approximation with <i>1/ε^1/3</i> matrix-vector products.

Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time.

Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra.

Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, Honghao Lin, David P. Woodruff

Proceedings of the International Conference on Machine Learning, 2022

2021

Integration of Data and Theory for Accelerated Derivable Symbolic Discovery.

Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh

CoRR, 2021

Quantum Topological Data Analysis with Linear Depth and Exponential Speedup.

Shashanka Ubaru, Ismail Yunus Akhalwaya, Mark S. Squillante, Kenneth L. Clarkson, Lior Horesh

CoRR, 2021

Order Embeddings from Merged Ontologies using Sketching.

Kenneth L. Clarkson, Sanjana Sahayaraj

CoRR, 2021

Capacity and Bias of Learned Geometric Embeddings for Directed Graphs.

Michael Boratko, Dongxu Zhang, Nicholas Monath, Luke Vilnis, Kenneth L. Clarkson, Andrew McCallum

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

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

Proceedings of the 38th International Conference on Machine Learning, 2021

Sparse Graph Based Sketching for Fast Numerical Linear Algebra.

Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis

Proceedings of the IEEE International Conference on Acoustics, 2021

2020

Random Sampling with Removal.

Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák

Discret. Comput. Geom., 2020

Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra.

Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, David P. Woodruff

CoRR, 2020

Projection techniques to update the truncated SVD of evolving matrices.

Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson

CoRR, 2020

2019

Dimensionality Reduction for Tukey Regression.

Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff

Proceedings of the 36th International Conference on Machine Learning, 2019

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

Proceedings of the Conference on Learning Theory, 2019

2018

Data Infrastructure and Approaches for Ontology-Based Drug Repurposing.

Stephen Boyer, Thomas D. Griffin, Sarath Swaminathan, Kenneth L. Clarkson, Dmitry Zubarev

CoRR, 2018

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

Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2018, 2018

User-Centric Ontology Population.

Kenneth L. Clarkson, Anna Lisa Gentile, Daniel Gruhl, Petar Ristoski, Joseph Terdiman, Steve Welch

Proceedings of the Semantic Web - 15th International Conference, 2018

2017

Faster Kernel Ridge Regression Using Sketching and Preconditioning.

Haim Avron, Kenneth L. Clarkson, David P. Woodruff

SIAM J. Matrix Anal. Appl., 2017

Low-Rank PSD Approximation in Input-Sparsity Time.

Kenneth L. Clarkson, David P. Woodruff

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Sharper Bounds for Regularized Data Fitting.

Haim Avron, Kenneth L. Clarkson, David P. Woodruff

Proceedings of the Approximation, 2017

2016

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

SIAM J. Comput., 2016

Thirtieth Anniversary Note from the Editors in Chief.

Kenneth L. Clarkson, János Pach, Günter M. Ziegler

Discret. Comput. Geom., 2016

Sharper Bounds for Regression and Low-Rank Approximation with Regularization.

Haim Avron, Kenneth L. Clarkson, David P. Woodruff

CoRR, 2016

2015

Sketching for <i>M</i>-Estimators: A Unified Approach to Robust Regression.

Kenneth L. Clarkson, David P. Woodruff

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Input Sparsity and Hardness for Robust Subspace Approximation.

Kenneth L. Clarkson, David P. Woodruff

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls.

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri

SIAM J. Comput., 2014

2013

Low rank approximation and regression in input sparsity time.

Kenneth L. Clarkson, David P. Woodruff

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

On the set multicover problem in geometric settings.

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled

ACM Trans. Algorithms, 2012

Sublinear optimization for machine learning.

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff

J. ACM, 2012

MSTor: A program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity.

Jingjing Zheng, Steven L. Mielke, Kenneth L. Clarkson, Donald G. Truhlar

Comput. Phys. Commun., 2012

Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri

CoRR, 2012

The Fast Cauchy Transform: with Applications to Basis Construction, Regression, and Subspace Approximation in L1

Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff

CoRR, 2012

Self-improving algorithms for coordinate-wise maxima.

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Self-Improving Algorithms.

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri

SIAM J. Comput., 2011

2010

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm.

Kenneth L. Clarkson

ACM Trans. Algorithms, 2010

Welcome from the Editors-in-Chief.

Kenneth L. Clarkson, Günter Rote

J. Comput. Geom., 2010

Self-improving Algorithms for Convex Hulls.

Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Schema covering: a step towards enabling reuse in information integration.

Barna Saha, Ioana Stanoi, Kenneth L. Clarkson

Proceedings of the 26th International Conference on Data Engineering, 2010

Toward Identity Anonymization in Social Networks.

Kenneth L. Clarkson, Kun Liu, Evimaria Terzi

Proceedings of the Link Mining: Models, Algorithms, and Applications, 2010

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint).

Kenneth L. Clarkson, Micha Sharir

General Books, ISBN: 978-1-153-46242-6, 2010

2009

Numerical linear algebra in the streaming model.

Kenneth L. Clarkson, David P. Woodruff

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

On the set multi-cover problem in geometric settings.

Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Optimal core-sets for balls.

Mihai Badoiu, Kenneth L. Clarkson

Comput. Geom., 2008

Self-improving algorithms for delaunay triangulations.

Kenneth L. Clarkson, C. Seshadhri

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures.

Kenneth L. Clarkson

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Tighter bounds for random projections of manifolds.

Kenneth L. Clarkson

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Improved Approximation Algorithms for Geometric Set Cover.

Kenneth L. Clarkson, Kasturi R. Varadarajan

Discret. Comput. Geom., 2007

Modeling UpLink Power Control with Outage Probabilities.

Kenneth L. Clarkson, Georg K. Hampel, John D. Hobby

Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits.

Kenneth L. Clarkson, John D. Hobby

Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

2006

Building triangulations using epsilon-nets.

Kenneth L. Clarkson

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2003

User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems.

Simon C. Borst, Kenneth L. Clarkson, John M. Graybeal, Harish Viswanathan, Philip A. Whiting

Bell Labs Tech. J., 2003

Smaller core-sets for balls.

Mihai Badoiu, Kenneth L. Clarkson

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001

Fast multiple-antenna differential decoding.

Kenneth L. Clarkson, Wim Sweldens, Alice Zheng

IEEE Trans. Commun., 2001

1999

Guest Editor's Foreword.

Kenneth L. Clarkson

Discret. Comput. Geom., 1999

Nearest Neighbor Queries in Metric Spaces.

Kenneth L. Clarkson

Discret. Comput. Geom., 1999

1998

SODA '95 Papers.

Kenneth L. Clarkson

J. Algorithms, 1998

1996

Approximating center points with iterative Radon points.

Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng

Int. J. Comput. Geom. Appl., 1996

1995

Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small.

Kenneth L. Clarkson

J. ACM, 1995

1994

More Output-Sensitive Geometric Algorithms (Extended Abstract)

Kenneth L. Clarkson

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

An Algorithm for Approximate Closest-Point Queries.

Kenneth L. Clarkson

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.

Kenneth L. Clarkson

Discret. Comput. Geom., 1993

Four Results on Randomized Incremental Constructions.

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel

Comput. Geom., 1993

Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls.

Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine

Algorithmica, 1993

Algorithms for Polytope Covering and Approximation.

Kenneth L. Clarkson

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Approximating Center Points with Iterated Radon Points.

Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Erratum: Randomized parallel algorithms for trapezoidal diagrams.

Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan

Int. J. Comput. Geom. Appl., 1992

Randomized parallel algorithms for trapezoidal diagrams.

Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan

Int. J. Comput. Geom. Appl., 1992

Safe and Effective Determinant Evaluation

Kenneth L. Clarkson

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations.

Kenneth L. Clarkson

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1990

1989

A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.

Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk

Discret. Comput. Geom., 1989

Application of Random Sampling in Computational Geometry, II.

Kenneth L. Clarkson, Peter W. Shor

Discret. Comput. Geom., 1989

An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time.

Kenneth L. Clarkson

Algorithmica, 1989

1988

A Randomized Algorithm for Closest-Point Queries.

Kenneth L. Clarkson

SIAM J. Comput., 1988

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

A Las Vegas Algorithm for Linear Programming When the Dimension Is Small

Kenneth L. Clarkson

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental.

Kenneth L. Clarkson, Peter W. Shor

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Applications of Random Sampling in Computational Geometry, II.

Kenneth L. Clarkson

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time.

Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson

Theor. Comput. Sci., 1987

New Applications of random Sampling in Computational Geometry.

Kenneth L. Clarkson

Discret. Comput. Geom., 1987

Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract)

Kenneth L. Clarkson

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)²) Time.

Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Linear Programming in O(n * (3_d)_2) Time.

Kenneth L. Clarkson

Inf. Process. Lett., 1986

Further Applications of Random Sampling to Computational Geometry

Kenneth L. Clarkson

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

A Probabilistic Algorithm for the Post Office Problem

Kenneth L. Clarkson

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract)

Kenneth L. Clarkson

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

A Modification of the Greedy Algorithm for Vertex Cover.

Kenneth L. Clarkson

Inf. Process. Lett., 1983

Fast Algorithms for the All Nearest Neighbors Problem

Kenneth L. Clarkson

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983