1. Structured matrix-based methods for polynomial ϵ-GCD: analysis and comparisons;Bini,2007
2. A fast algorithm for approximate polynomial GCD based on structured matrix computations;Bini,2010
3. Bernstein–Bezoutian matrices;Bini;Theor. Comput. Sci.,2004
4. Computing curve intersection by means of simultaneous iterations;Bini;Numer. Algorithms,2006
5. Optimization strategies for the approximate GCD problem;Chin,1998