On selecting a maximum volume sub-matrix of a matrix and related problems

Factoring polynomials with rational coefficients

A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text

Natural Sciences, Mathematics, Algebra +4

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

Ming Gu, Stanley C. Eisenstat · SIAM Journal on Scientific Computing · 1996 · 702 citations

Computing, Computer Engineering, Computer Science +13

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

Petros Drineas, Ravi Kannan, Michael W. Mahoney · SIAM Journal on Computing · 2006 · 566 citations

Computing, Computer Science, Algorithms +15

Rank revealing QR factorizations

Tony F. Chan · Linear Algebra and its Applications · 1987 · 527 citations

Computing, Computer Science, Data Analytics +5

Fast monte-carlo algorithms for finding low-rank approximations

Alan Frieze, Ravi Kannan, Santosh Vempala · Journal of the ACM · 2004 · 509 citations

Computing, Computer Science, Mathematics +17