Fetching the paper…
Reading the bibliography…
Many algorithms use data structures that maintain properties of matrices undergoing some changes.
Some theorems in least squares
Ronald L Plackett · 1950
Earlier work this paper cites.
Adjustment of an inverse matrix corresponding to a change in one element of a given matrix
Jack Sherman and Winifred J Morrison · 1950
Earlier work this paper cites.
Max A Woodbury · 1950
Earlier work this paper cites.
A numerical investigation of the simplex method
Richard H Bartels · 1968
Earlier work this paper cites.
The simplex method of linear programming using LU decomposition
Richard H. Bartels and Gene H. Golub · 1969
Earlier work this paper cites.
How good is the simplex algorithm
Victor Klee and George J Minty · 1972
Earlier work this paper cites.
Algorithm as 75: Basic procedures for large, sparse or weighted linear least problems
W Morven Gentleman · 1974
Earlier work this paper cites.
On the bartels - golub decomposition for linear programming bases
Donald Goldfarb · 1977
Earlier work this paper cites.
A sparsity-exploiting variant of the bartels - golub decomposition for linear programming bases
John K. Reid · 1982
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · 1984
Earlier work this paper cites.
The efficiency of the simplex method: a survey
Ron Shamir · 1987
Earlier work this paper cites.
Speeding-up linear programming using fast matrix multiplication (extended abstract)
Pravin M. Vaidya · 1989
Earlier work this paper cites.
A subexponential randomized simplex algorithm (extended abstract)
Gil Kalai · 1992
Earlier work this paper cites.
Computational complexity
Christos H. Papadimitriou · 1994
Earlier work this paper cites.
Algebraic complexity theory
Peter Bürgisser, Michael Clausen, and Mohammad Amin Shokrollahi · 1997
Earlier work this paper cites.
Using fast matrix multiplication to find basic solutions
Peter A. Beling and Nimrod Megiddo · 1998
Cited alongside, same era.
Applying recursion to serial and parallel QR factorization leads to better performance
Erik Elmroth and Fred G. Gustavson · 2000
Cited alongside, same era.
Dynamic transitive closure via dynamic matrix inverse (extended abstract)
Piotr Sankowski · 2004
Cited alongside, same era.
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Daniel A. Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Online visual motion estimation using fastslam with SIFT features
Timothy D. Barfoot · 2005
Cited alongside, same era.
Improved smoothed analysis of the shadow vertex simplex method
Amit Deshpande and Daniel A. Spielman · 2005
A relaxed algorithm for online matrix inversion
Arne Storjohann and Shiyun Yang · 2015
Later among the works it cites.
Faster geometric algorithms via dynamic determinant computation
Vissarion Fisikopoulos and Luis Mariano Peñaranda · 2016
Later among the works it cites.
Learning background-aware correlation filters for visual tracking
Hamed Kiani Galoogahi, Ashton Fagg, and Simon Lucey · 2017
Later among the works it cites.
A friendly smoothed analysis of the simplex method
Daniel Dadush and Sophie Huiberts · 2018
Later among the works it cites.
Iterative refinement for ℓ p \ell_{p} -norm regression
Deeksha Adil, Rasmus Kyng, Richard Peng, and Sushant Sachdeva · 2019
Later among the works it cites.
Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time
Jan van den Brand and Danupon Nanongkai · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Subquadratic algorithm for dynamic shortest distances
Piotr Sankowski · 2005
Cited alongside, same era.
A randomized polynomial-time simplex algorithm for linear programming
Jonathan A. Kelner and Daniel A. Spielman · 2006
Cited alongside, same era.
Maximum matchings in planar graphs via gaussian elimination
Marcin Mucha and Piotr Sankowski · 2006
Cited alongside, same era.
Fast linear algebra is stable
James Demmel, Ioana Dumitriu, and Olga Holtz · 2007
Cited alongside, same era.
Faster dynamic matchings and vertex connectivity
Piotr Sankowski · 2007
Cited alongside, same era.
Beyond hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method
Roman Vershynin · 2009
Cited alongside, same era.
Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds
Jan van den Brand, Danupon Nanongkai, and Thatchaphol Saranurak · 2019
Later among the works it cites.
Sensitive distance and reachability oracles for large batch updates
Jan van den Brand and Thatchaphol Saranurak · 2019
Later among the works it cites.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2019
Later among the works it cites.
Solving empirical risk minimization in the current matrix multiplication time
Yin Tat Lee, Zhao Song, and Qiuyi Zhang · 2019
Later among the works it cites.
Solving tall dense linear programs in nearly linear time
Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song · 2020
Closest in time.
A deterministic linear program solver in current matrix multiplication time
Jan van den Brand · 2020
Closest in time.
An improved cutting plane method for convex optimization, convex-concave games, and its applications
Haotian Jiang, Yin Tat Lee, Zhao Song, and Sam Chiu-wai Wong · 2020
Closest in time.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2020
Closest in time.