Kenneth L. Clarkson

119 papers A* 33A 1B 2Misc 1Journal 63Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Finding Clustering Algorithms in the Transformer Architecture. CoRR Kenneth L. Clarkson, Lior Horesh, Takuya Ito, Charlotte Park, Parikshit Ram
2025	J	`jnl`	Predictability Enables Parallelization of Nonlinear State Space Models. CoRR Xavier Gonzalez, Leo Kozachkov, David M. Zoltowski, Kenneth L. Clarkson, Scott W. Linderman
2025	J	`jnl`	Transformers Learn Faster with Semantic Focus. CoRR Parikshit Ram, Kenneth L. Clarkson, Tim Klinger, Shashanka Ubaru, Alexander G. Gray
2024	J	`jnl`	Foreword. Discret. Comput. Geom. Kenneth L. Clarkson, János Pach, Csaba D. Tóth
2024	A*	`conf`	Topological data analysis on noisy quantum computers. ICLR Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L. Clarkson, Mark S. Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, Lior Horesh
2023	J	`jnl`	Capacity Analysis of Vector Symbolic Architectures. CoRR Kenneth L. Clarkson, Shashanka Ubaru, Elizabeth Yang
2022	J	`jnl`	Bayesian Experimental Design for Symbolic Discovery. CoRR Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo
2022	J	`jnl`	Low-Rank Approximation with 1/ε CoRR Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff
2022	A*	`conf`	Low-rank approximation with STOC Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff
2022	A*	`conf`	Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. SODA Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff
2022	A*	`conf`	Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. ICML Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, Honghao Lin, David P. Woodruff
2022	J	`jnl`	Towards Quantum Advantage on Noisy Quantum Computers. CoRR Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L. Clarkson, Mark S. Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, Lior Horesh
2021	A*	`conf`	Capacity and Bias of Learned Geometric Embeddings for Directed Graphs. NeurIPS Michael Boratko, Dongxu Zhang, Nicholas Monath, Luke Vilnis, Kenneth L. Clarkson, Andrew McCallum
2021	J	`jnl`	Integration of Data and Theory for Accelerated Derivable Symbolic Discovery. CoRR Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh
2021	J	`jnl`	Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. CoRR Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff
2021	J	`jnl`	Order Embeddings from Merged Ontologies using Sketching. CoRR Kenneth L. Clarkson, Sanjana Sahayaraj
2021	A*	`conf`	Projection techniques to update the truncated SVD of evolving matrices with applications. ICML Vasileios Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson
2021	J	`jnl`	Quantum Topological Data Analysis with Linear Depth and Exponential Speedup. CoRR Shashanka Ubaru, Ismail Yunus Akhalwaya, Mark S. Squillante, Kenneth L. Clarkson, Lior Horesh
2021	Misc	`conf`	Sparse Graph Based Sketching for Fast Numerical Linear Algebra. ICASSP Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis
2021	J	`jnl`	Sparse graph based sketching for fast numerical linear algebra. CoRR Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis
2020	J	`jnl`	Projection techniques to update the truncated SVD of evolving matrices. CoRR Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson
2020	J	`jnl`	Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. CoRR Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, David P. Woodruff
2020	J	`jnl`	Random Sampling with Removal. Discret. Comput. Geom. Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák
2019	A*	`conf`	Dimensionality Reduction for Tukey Regression. ICML Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff
2019	J	`jnl`	Dimensionality Reduction for Tukey Regression. CoRR Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff
2019	A*	`conf`	Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. COLT Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth
2019	J	`jnl`	Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. CoRR Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth
2018	J	`jnl`	Data Infrastructure and Approaches for Ontology-Based Drug Repurposing. CoRR Stephen Boyer, Thomas D. Griffin, Sarath Swaminathan, Kenneth L. Clarkson, Dmitry Zubarev
2018	—	`conf`	Hashing-Based Atlas Ranking and Selection for Multiple-Atlas Segmentation. MICCAI (4) Amin Katouzian, Hongzhi Wang, Sailesh Conjeti, Hui Tang, Ehsan Dehghan, Alexandros Karargyris, Anup Pillai, Kenneth L. Clarkson, Nassir Navab
2018	B	`conf`	User-Centric Ontology Population. ESWC Kenneth L. Clarkson, Anna Lisa Gentile, Daniel Gruhl, Petar Ristoski, Joseph Terdiman, Steve Welch
2017	J	`jnl`	Faster Kernel Ridge Regression Using Sketching and Preconditioning. SIAM J. Matrix Anal. Appl. Haim Avron, Kenneth L. Clarkson, David P. Woodruff
2017	A*	`conf`	Low-Rank PSD Approximation in Input-Sparsity Time. SODA Kenneth L. Clarkson, David P. Woodruff
2017	—	`conf`	Sharper Bounds for Regularized Data Fitting. APPROX-RANDOM Haim Avron, Kenneth L. Clarkson, David P. Woodruff
2016	J	`jnl`	Faster Kernel Ridge Regression Using Sketching and Preconditioning. CoRR Haim Avron, Kenneth L. Clarkson, David P. Woodruff
2016	J	`jnl`	Sharper Bounds for Regression and Low-Rank Approximation with Regularization. CoRR Haim Avron, Kenneth L. Clarkson, David P. Woodruff
2016	J	`jnl`	The Fast Cauchy Transform and Faster Robust Linear Regression. SIAM J. Comput. Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff
2016	J	`jnl`	Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. Kenneth L. Clarkson, János Pach, Günter M. Ziegler
2015	A*	`conf`	Input Sparsity and Hardness for Robust Subspace Approximation. FOCS Kenneth L. Clarkson, David P. Woodruff
2015	J	`jnl`	Input Sparsity and Hardness for Robust Subspace Approximation. CoRR Kenneth L. Clarkson, David P. Woodruff
2015	A*	`conf`	Sketching for SODA Kenneth L. Clarkson, David P. Woodruff
2014	J	`jnl`	Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2013	A*	`conf`	Low rank approximation and regression in input sparsity time. STOC Kenneth L. Clarkson, David P. Woodruff
2013	A*	`conf`	The Fast Cauchy Transform and Faster Robust Linear Regression. SODA Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff
2012	J	`jnl`	Low Rank Approximation and Regression in Input Sparsity Time CoRR Kenneth L. Clarkson, David P. Woodruff
2012	J	`jnl`	MSTor: A program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity. Comput. Phys. Commun. Jingjing Zheng, Steven L. Mielke, Kenneth L. Clarkson, Donald G. Truhlar
2012	J	`jnl`	On the set multicover problem in geometric settings. ACM Trans. Algorithms Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2012	J	`jnl`	Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls CoRR Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	J	`jnl`	Self-improving Algorithms for Coordinate-wise Maxima CoRR Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	—	`conf`	Self-improving algorithms for coordinate-wise maxima. SCG Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2012	J	`jnl`	Sublinear optimization for machine learning. J. ACM Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2012	J	`jnl`	The Fast Cauchy Transform: with Applications to Basis Construction, Regression, and Subspace Approximation in L1 CoRR Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff
2011	J	`jnl`	Self-Improving Algorithms. SIAM J. Comput. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2010	—	`book`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). Kenneth L. Clarkson, Micha Sharir
2010	J	`jnl`	Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms Kenneth L. Clarkson
2010	A*	`conf`	Schema covering: a step towards enabling reuse in information integration. ICDE Barna Saha, Ioana Stanoi, Kenneth L. Clarkson
2010	A*	`conf`	Self-improving Algorithms for Convex Hulls. SODA Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2010	J	`jnl`	Sublinear Optimization for Machine Learning CoRR Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2010	A*	`conf`	Sublinear Optimization for Machine Learning. FOCS Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2010	—	`ch.`	Toward Identity Anonymization in Social Networks. Link Mining Kenneth L. Clarkson, Kun Liu, Evimaria Terzi
2010	J	`jnl`	Welcome from the Editors-in-Chief. J. Comput. Geom. Kenneth L. Clarkson, Günter Rote
2009	A*	`conf`	Numerical linear algebra in the streaming model. STOC Kenneth L. Clarkson, David P. Woodruff
2009	J	`jnl`	On the Set Multi-Cover Problem in Geometric Settings CoRR Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	—	`conf`	On the set multi-cover problem in geometric settings. SCG Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	J	`jnl`	Self-Improving Algorithms CoRR Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2008	A*	`conf`	Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. SODA Kenneth L. Clarkson
2008	—	`conf`	Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. SCG Kenneth L. Clarkson
2008	J	`jnl`	Optimal core-sets for balls. Comput. Geom. Mihai Badoiu, Kenneth L. Clarkson
2008	—	`conf`	Self-improving algorithms for delaunay triangulations. SCG Kenneth L. Clarkson, C. Seshadhri
2008	—	`conf`	Tighter bounds for random projections of manifolds. SCG Kenneth L. Clarkson
2007	J	`jnl`	Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. Kenneth L. Clarkson, Kasturi R. Varadarajan
2007	—	`conf`	Modeling UpLink Power Control with Outage Probabilities. VTC Fall Kenneth L. Clarkson, Georg K. Hampel, John D. Hobby
2007	—	`conf`	Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. VTC Fall Kenneth L. Clarkson, John D. Hobby
2006	A*	`conf`	Building triangulations using epsilon-nets. STOC Kenneth L. Clarkson
2005	J	`jnl`	Improved Approximation Algorithms for Geometric Set Cover CoRR Kenneth L. Clarkson, Kasturi R. Varadarajan
2005	—	`conf`	Improved approximation algorithms for geometric set cover. SCG Kenneth L. Clarkson, Kasturi R. Varadarajan
2003	A*	`conf`	Smaller core-sets for balls. SODA Mihai Badoiu, Kenneth L. Clarkson
2003	J	`jnl`	User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems. Bell Labs Tech. J. Simon C. Borst, Kenneth L. Clarkson, John M. Graybeal, Harish Viswanathan, Philip A. Whiting
2001	J	`jnl`	Fast multiple-antenna differential decoding. IEEE Trans. Commun. Kenneth L. Clarkson, Wim Sweldens, Alice Zheng
1999	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Kenneth L. Clarkson
1999	J	`jnl`	Nearest Neighbor Queries in Metric Spaces. Discret. Comput. Geom. Kenneth L. Clarkson
1998	J	`jnl`	SODA '95 Papers. J. Algorithms Kenneth L. Clarkson
1997	A*	`conf`	Nearest Neighbor Queries in Metric Spaces. STOC Kenneth L. Clarkson
1996	J	`jnl`	Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1995	J	`jnl`	Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. J. ACM Kenneth L. Clarkson
1995	A*	`ed.`	Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1995. San Francisco, California, USA. SODA Kenneth L. Clarkson
1994	—	`conf`	An Algorithm for Approximate Closest-Point Queries. SCG Kenneth L. Clarkson
1994	A*	`conf`	More Output-Sensitive Geometric Algorithms (Extended Abstract) FOCS Kenneth L. Clarkson
1993	J	`jnl`	A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. Discret. Comput. Geom. Kenneth L. Clarkson
1993	B	`conf`	Algorithms for Polytope Covering and Approximation. WADS Kenneth L. Clarkson
1993	—	`conf`	Approximating Center Points with Iterated Radon Points. SCG Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1993	J	`jnl`	Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Algorithmica Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
1993	J	`jnl`	Four Results on Randomized Incremental Constructions. Comput. Geom. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
1992	J	`jnl`	Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	A	`conf`	Four Results on Randomized Incremental Constructions. STACS Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
1992	J	`jnl`	Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	A*	`conf`	Safe and Effective Determinant Evaluation FOCS Kenneth L. Clarkson
1991	A*	`conf`	Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. SODA Kenneth L. Clarkson
1991	—	`conf`	Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1990	J	`jnl`	Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1990	A*	`conf`	Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
1989	J	`jnl`	A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discret. Comput. Geom. Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
1989	J	`jnl`	An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica Kenneth L. Clarkson
1989	J	`jnl`	Application of Random Sampling in Computational Geometry, II. Discret. Comput. Geom. Kenneth L. Clarkson, Peter W. Shor
1988	—	`conf`	A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. SCG Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
1988	A*	`conf`	A Las Vegas Algorithm for Linear Programming When the Dimension Is Small FOCS Kenneth L. Clarkson
1988	J	`jnl`	A Randomized Algorithm for Closest-Point Queries. SIAM J. Comput. Kenneth L. Clarkson
1988	—	`conf`	Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. SCG Kenneth L. Clarkson, Peter W. Shor
1988	—	`conf`	Applications of Random Sampling in Computational Geometry, II. SCG Kenneth L. Clarkson
1988	A*	`conf`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1987	A*	`conf`	Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) STOC Kenneth L. Clarkson
1987	J	`jnl`	New Applications of random Sampling in Computational Geometry. Discret. Comput. Geom. Kenneth L. Clarkson
1987	—	`conf`	Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n) SCG Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
1987	J	`jnl`	Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. Theor. Comput. Sci. Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson
1986	A*	`conf`	Further Applications of Random Sampling to Computational Geometry STOC Kenneth L. Clarkson
1986	J	`jnl`	Linear Programming in O(n * (3_d)_2) Time. Inf. Process. Lett. Kenneth L. Clarkson
1985	A*	`conf`	A Probabilistic Algorithm for the Post Office Problem STOC Kenneth L. Clarkson
1984	A*	`conf`	Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) STOC Kenneth L. Clarkson
1983	J	`jnl`	A Modification of the Greedy Algorithm for Vertex Cover. Inf. Process. Lett. Kenneth L. Clarkson
1983	A*	`conf`	Fast Algorithms for the All Nearest Neighbors Problem FOCS Kenneth L. Clarkson