Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication TimeNadiia ChepurkoKenneth L. Clarksonet al.2022SODA 2022
Sparse graph based sketching for fast numerical linear algebraDong HuShashanka Ubaruet al.2021ICASSP 2021
Input Sparsity and Hardness for Robust Subspace ApproximationKenneth L. ClarksonDavid P. Woodruff2015FOCS 2015
Low rank approximation and regression in input sparsity timeKenneth L. ClarksonDavid P. Woodruff2013STOC 2013
The fast cauchy transform and faster robust linear regressionKenneth L. ClarksonPetros Drineaset al.2013SODA 2013
Self-improving algorithms for coordinate-wise maximaKenneth L. ClarksonWolfgang Mulzeret al.2012SCG 2012
Schema covering: A step towards enabling reuse in information integrationBarna SahaIoana Stanoiet al.2010ICDE 2010