A new polynomial-time algorithm for linear programming
Approximate polynomial greatest common divisors and nearest singular polynomials
Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC ’96
Combinatorica
Y. N. Lakshman
On computing nearest singular hankel matrices
Sublinear algorithms for testing monotone and unimodal distributions