Fast monte-carlo algorithms for finding low-rank approximations
Random sampling and approximation of MAX-CSP problems
Random sampling and approximation of MAX-CSPs
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Faster mixing via average conductance
SIAM Journal on Computing
Journal of Computer and System Sciences
Journal of the ACM
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Noga Alon
Marek Karpinski
Petros Drineas
Michael W. Mahoney
László Lovász
W.Fernandez de la Vega
Sampling from large matrices
Matrix Sketching Over Sliding Windows
Approximating the cut-norm via Grothendieck’s inequality
Aggregate Estimation over a Microblog Platform
Continuous matrix approximation on distributed data