On approximate irreducibility of polynomials in several variables
Fast parallel absolute irreducibility testing
Deterministic irreducibility testing of polynomials over large finite fields
On randomized Lanczos algorithms
Efficient algorithms for computing the nearest polynomial with constrained roots
Efficient algorithms for computing the nearest polynomial with a real root and related problems
Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC ’97
Proceedings of the 2003 international symposium on Symbolic and algebraic computation - ISSAC ’03
Journal of Symbolic Computation
Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC ’98
Proceedings of the 1999 international symposium on Symbolic and algebraic computation - ISSAC ’99
Markus A. Hitz
Wayne Eberly
Y. N. Lakshman
John May
On computing nearest singular hankel matrices
Black box methods for least squares problems
Computing the irreducible real factors and components of an algebraicf curve