, Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor, International Journal of Computer Mathematics, vol.4, issue.10, p.8112231238, 2004.
DOI : 10.1006/jsco.1999.0322
, Bezout matrices, Subresultant polynomials and parameters, Applied Mathematics and Computation, vol.214, issue.2, p.588594, 2009.
DOI : 10.1016/j.amc.2009.04.032
, The Design and Analysis of Computer Algorithms, 1974.
, A new method for computing polynomial greatest common divisors and polynomial remainder sequences, Numer. Math, vol.52, issue.2, p.119127, 1988.
, Sylvester's forgotten form of the resultant, Fibonacci Quart, vol.31, issue.4, p.325332, 1993.
, ?????????????????? ???????????????????? ???????????????????????????????? ?????????????????????????? ?????????????????????????????????????? ???????????????? ?? ???????????????????????? ????????????????, Reliable Computing, vol.16, issue.4, p.375381, 1995.
DOI : 10.1007/BF02391682
, Fast Matrix Computation of Subresultant Polynomial Remainder Sequences, Computer Algebra in Scientic Computing, p.111, 2000.
DOI : 10.1007/978-3-642-57201-2_1
, Faster sparse multivariate polynomial interpolation of straight-line programs, Journal of Symbolic Computation, vol.75, p.424, 2016.
DOI : 10.1016/j.jsc.2015.11.005
, On computing the determinant in small parallel time using a small number of processors, Information Processing Letters, vol.18, issue.3, p.147150, 1984.
DOI : 10.1016/0020-0190(84)90018-8
, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Mathematics of Computation, vol.81, issue.279, pp.81-2012
DOI : 10.1090/S0025-5718-2011-02562-7
URL : https://hal.archives-ouvertes.fr/hal-00526659
, Fast fraction-free triangularization of Bezoutians with applications to sub-resultant chain computation, Linear Algebra and its Applications, vol.284, issue.1-3, p.1939, 1998.
DOI : 10.1016/S0024-3795(98)10075-7
, Introduction to higher algebra. The MacMillan Compagny, 1907.
, Fast solution of toeplitz systems of equations and computation of Pad?? approximants, Journal of Algorithms, vol.1, issue.3, p.259295, 1980.
DOI : 10.1016/0196-6774(80)90013-9
, On Euclid's algorithm and the computation of polynomial greatest common divisors, J. ACM, vol.18, issue.4, p.478504, 1971.
, On Euclid's Algorithm and the Theory of Subresultants, Journal of the ACM, vol.18, issue.4, p.505514, 1971.
DOI : 10.1145/321662.321665
, Algebraic complexity theory, 1997.
DOI : 10.1007/978-3-662-03338-8
, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, p.693701, 1991.
DOI : 10.1007/BF01178683
, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol.138, 1993.
DOI : 10.1007/978-3-662-02945-9
, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM, vol.14, issue.1, p.128142, 1967.
DOI : 10.1145/321371.321381
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.8488
, The calculation of multivariate polynomial resultants, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (SYMSAC '71), p.212222, 1971.
, Algorithme de Bareiss, algorithme des sous-résultants. Informatique théorique et applications, p.319347, 1996.
DOI : 10.1051/ita/1996300403191
URL : http://archive.numdam.org/article/ITA_1996__30_4_319_0.pdf
, Optimizations of the subresultant algorithm, Journal of Pure and Applied Algebra, vol.145, issue.2, p.149163, 2000.
DOI : 10.1016/S0022-4049(98)00081-4
, An elementary approach to subresultants theory, Journal of Symbolic Computation, vol.35, issue.3, p.281292, 2003.
DOI : 10.1016/S0747-7171(02)00135-9
URL : http://doi.org/10.1016/s0747-7171(02)00135-9
, Modern computer algebra, 2013.
DOI : 10.1017/CBO9781139856065
, Subresultants revisited, Theoret. Comput. Sci, vol.297, issue.1, 2003.
, Deterministic root nding over nite elds using Graee transforms, Appl. Algebra Engrg. Comm. Comput, vol.27, issue.3, p.237257, 2016.
DOI : 10.1007/s00200-015-0280-5
, Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens, Comment. Math. Helv, vol.21, issue.1, p.99116, 1948.
DOI : 10.1007/bf02568028
URL : http://www.digizeitschriften.de/download/PPN358147735_0021/PPN358147735_0021___log11.pdf
, Mathemagix User Guide École polytechnique, France, 2013.
, Sparse Polynomial Interpolation in Practice, 2014. In section "ISSAC 2014 Software Presentations
DOI : 10.1145/2733693.2733721
URL : https://hal.archives-ouvertes.fr/hal-00980366
, Division-free computation of subresultants using Bezout matrices, International Journal of Computer Mathematics, vol.2122, issue.12, p.21862200, 2009.
DOI : 10.1016/S0304-3975(02)00639-4
, The analysis of algorithms, p.269274, 1971.
, Fast separable factorization and applications, Applicable Algebra in Engineering, Communication and Computing, vol.102, issue.1, p.135160, 2008.
DOI : 10.1007/s00200-008-0062-4
URL : https://hal.archives-ouvertes.fr/hal-00681420
, Euclid's Algorithm for Large Numbers, The American Mathematical Monthly, vol.45, issue.4, p.227233, 1938.
DOI : 10.2307/2302607
, Cauchy index computation, Calcolo, vol.33, issue.3-4, p.337351, 1996.
, SylvesterHabicht sequences and fast Cauchy index computation, J. Symbolic Comput, vol.31, issue.3, p.315341, 2001.
, Safey El Din. New structure theorem for subresultants, J. Symbolic Comput, vol.29, issue.45, p.663690, 2000.
, Generalized polynomial remainder sequences, Computer algebra. Symbolic and Algebraic Computation, p.115137, 1982.
DOI : 10.1007/978-3-7091-3406-1_9
, Fast computation of GCDs, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, p.142151, 1973.
DOI : 10.1145/800125.804045
, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, p.233240, 1997.
DOI : 10.1145/258726.258792
, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, p.139144, 1971.
, Fundamental Problems in Algorithmic Algebra, 2000.