A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Algorithms, 1974.

A. Alesina and M. Galuzzi, A new proof of Vincent's theorem

W. Auzinger and H. J. Stetter, An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations, Proc. Intern. Conf. on Numerical Math., Intern. Series of Numerical Math, pp.12-30, 1988.
DOI : 10.1007/978-3-0348-6303-2_2

E. Bach and J. Shallit, Algorithmic Number Theory, 1996.

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing Communication in Numerical Linear Algebra, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.3, 2011.
DOI : 10.1137/090769156

E. H. Bareiss, Sylvester's identity and multistep integers preserving Gaussian elimination, Math. Comp, vol.22, pp.565-578, 1968.
DOI : 10.2307/2004533

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2003.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

M. Benzi, Preconditioning Techniques for Large Linear Systems: A Survey, Journal of Computational Physics, vol.182, issue.2, pp.418-477, 2002.
DOI : 10.1006/jcph.2002.7176

E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, L. Kettner et al., EX- ACUS: Efficient and Exact Algorithms for Curves and Surfaces, pp.1669-155, 2005.

E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation, vol.24, issue.111, pp.713-735, 1970.
DOI : 10.1090/S0025-5718-1970-0276200-X

D. N. Bernshtein, The number of roots of a system of equations, Functional Analysis and Its Applications, vol.30, issue.2, pp.183-185, 1975.
DOI : 10.1007/BF01075595

D. A. Bini and P. Boito, A fast algorithm for approximate polynomial GCD based on structured matrix computations. Operator Theory: Advances and Applications, pp.155-173, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00601849

D. A. Bini, P. Boito, Y. Eidelman, L. Gemignani, and I. Gohberg, A fast implicit QR eigenvalue algorithm for companion matrices, Linear Algebra and its Applications, vol.432, issue.8, 2006.
DOI : 10.1016/j.laa.2009.08.003
URL : https://hal.archives-ouvertes.fr/hal-00601708

D. A. Bini and G. Fiorentino, Design, analysis, and implementation of a Mmultiprecision polynomial rootfinder, Numerical Algorithms, vol.23, issue.2/3, pp.127-173, 2000.
DOI : 10.1023/A:1019199917103

D. A. Bini, L. Gemignani, and V. Y. Pan, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Computers & Mathematics with Applications, vol.47, issue.2-3, pp.47-447, 2004.
DOI : 10.1016/S0898-1221(04)90037-5

D. A. Bini, L. Gemignani, and V. Y. Pan, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Numerische Mathematik, vol.76, issue.3, pp.373-408, 2005.
DOI : 10.1007/s00211-005-0595-4

D. A. Bini, L. Gemignani, and V. Y. Pan, Improved initialization of the accelerated and robust QR-like polynomial root-finding, Electronic Transactions on Numerical Analysis, vol.17, pp.195-205, 2004.

D. Bini and V. Y. Pan, Polynomial division and its computational complexity, Journal of Complexity, vol.2, issue.3, pp.179-203, 1986.
DOI : 10.1016/0885-064X(86)90001-4
URL : http://doi.org/10.1016/0885-064x(86)90001-4

?. A. Björck, Numerical Methods for Least Squares Problems, SIAM, 1996.
DOI : 10.1137/1.9781611971484

D. Bondyfalat, B. Mourrain, and V. Y. Pan, Computation of a specified root of a polynomial system of equations using eigenvectors. Linear Alg, Also Proc. ISSAC, pp.193-209, 1998.

A. Borodin and I. Munro, Computational Complexity of Algebraic and Numeric Problems, 1975.

H. Brönnimann, I. Z. Emiris, V. Y. Pan, and S. Pion, Sign determination in residue number systems, Theoretical Computer Science, vol.210, issue.1, pp.173-197, 1999.
DOI : 10.1016/S0304-3975(98)00101-7

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Dissertation, 1965.

B. Buchberger, A theoretical basis for the reduction of polynomials to canonical forms, ACM SIGSAM Bulletin, vol.10, issue.3, pp.19-29, 1976.
DOI : 10.1145/1088216.1088219

B. Buchberger, Gröbner bases: An algorithmic method in polynomial ideal theory In Recent Trends in Multidimensional Systems Theory, D. Reidel, pp.184-232, 1985.

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, 1997.
DOI : 10.1007/978-3-662-03338-8

L. Busé and C. D-'andrea, Inversion of parameterized hypersurfaces by means of subresultants, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.65-71, 2004.
DOI : 10.1145/1005285.1005297

L. Busé, M. Elkadi, and B. Mourrain, Resultant over the residual of a complete intersection, Journal of Pure and Applied Algebra, vol.164, issue.1-2, pp.35-57, 2001.
DOI : 10.1016/S0022-4049(00)00144-4

L. Busé, M. Elkadi, and B. Mourrain, Editorial, Special Issue on Algebraic? Geometric Computations, pp.1-178, 2008.
DOI : 10.1016/j.tcs.2007.10.001

J. Canny, Some algebraic and geometric computations in PSPACE, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.460-467, 1988.
DOI : 10.1145/62212.62257

J. Canny, Generalized characteristic polynomials, J. Symbolic Computation, vol.9, issue.3, pp.241-250, 1990.
DOI : 10.1007/3-540-51084-2_28

J. Canny and I. Z. Emiris, A subdivision-based algorithm for the sparse resultant, Journal of the ACM, vol.47, issue.3, pp.417-451, 2000.
DOI : 10.1145/337244.337247

J. Canny, E. Kaltofen, and Y. Lakshman, Solving systems of non-linear polynomial equations faster, Proc. ISSAC, pp.121-128, 1989.

J. Canny and D. Manocha, Efficient techniques for multipolynomial resultant algorithms, Proc. ISSAC, pp.85-95, 1991.

J. Canny and P. Pedersen, An algorithm for the Newton resultant, 1993.

J. Cardinal and B. Mourrain, Algebraic approach of residues and applications, In The Math. of Numerical Analysis, Lects. in Applied Math, vol.32, pp.189-210, 1996.

F. Chen, D. A. Cox, and Y. Liu, The <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-basis and implicitization of a rational parametric surface, Journal of Symbolic Computation, vol.39, issue.6, pp.689-706, 2005.
DOI : 10.1016/j.jsc.2005.01.003

Z. Chen and A. Storjohann, A BLAS based C library for exact linear algebra on integer matrices, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.92-99, 2005.
DOI : 10.1145/1073884.1073899

H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans, Group-theoretic Algorithms for Matrix Multiplication, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.379-388, 2005.
DOI : 10.1109/SFCS.2005.39

K. L. Clarkson, Safe and effective determinant evaluation, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.387-395, 1992.
DOI : 10.1109/SFCS.1992.267751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.5814

G. E. Collins and A. Akritas, Polynomial real root isolation using Descartes' rule of signs, SYMSAC '76, pp.272-275, 1976.

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

D. A. Cox, Gröbner bases: a sampler of recent developments, Proc. ISSAC, pp.387-388, 2007.

D. Cox, J. Little, and D. O-'shea, Using Algebraic Geometry, Graduate Texts in Mathematics, vol.185, 2005.
DOI : 10.1007/978-1-4757-6911-1

D. 'andrea and C. , Macaulay-style formulas for the sparse resultant, Transactions of the American Mathematical Society, vol.354, issue.07, pp.2595-2629, 2002.
DOI : 10.1090/S0002-9947-02-02910-0

D. 'andrea, C. Krick, T. Szanto, and A. , Multivariate subresultants in roots, Journal of Algebra, vol.302, issue.1, pp.16-36, 2006.
DOI : 10.1016/j.jalgebra.2005.08.016

D. 'andrea, C. Emiris, and I. Z. , Computing sparse projection operators, Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, pp.121-139, 2001.

D. Daney and I. Z. Emiris, Robust parallel robot calibration with partial information, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), pp.3262-3267, 2001.
DOI : 10.1109/ROBOT.2001.933121
URL : https://hal.archives-ouvertes.fr/inria-00100583

A. Dickenstein and I. Z. Emiris, Multihomogeneous resultant formulae by means of complexes, Journal of Symbolic Computation, vol.36, issue.3-4, pp.317-342, 2003.
DOI : 10.1016/S0747-7171(03)00086-5

A. Dickenstein and I. Z. Emiris, Solving polynomial equations: foundations , algorithms and applications, Algorithms and Computation in Mathematics, 2005.

A. Dickenstein and B. Sturmfels, Elimination Theory in Codimension 2, Journal of Symbolic Computation, vol.34, issue.2, pp.119-135, 2002.
DOI : 10.1006/jsco.2002.0545

A. L. Dixon, The elimination of three quantics in two independent variables, Proc, pp.468-478, 1908.

Z. Du, V. Sharma, and C. K. Yap, Amortized Bound for Root Isolation via Sturm Sequences, pp.113-129
DOI : 10.1007/978-3-7643-7984-1_8

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

J. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen et al., LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA, Mathematical Software, pp.40-50, 2002.
DOI : 10.1142/9789812777171_0005

J. Dumas, T. Gautier, and C. Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.63-74, 2002.
DOI : 10.1145/780506.780515

J. Dumas, P. Giorgi, and C. Pernet, Finite field linear algebra package, Proc. ISSAC, pp.118-126, 2004.

Y. Eidelman and I. Gohberg, On a New Class of Structured Matrices, Integral Equations and Operator Theory, pp.293-324, 1999.

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, and G. Villard, Faster inversion and other black box matrix computations using efficient block projections, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.143-150, 2007.
DOI : 10.1145/1277548.1277569
URL : https://hal.archives-ouvertes.fr/hal-00127807

W. Eberly, M. Giesbrecht, and G. Villard, On computing the determinant and Smith form of an integer matrix, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.675-685, 2000.
DOI : 10.1109/SFCS.2000.892335

A. Eigenwillig, L. Kettner, W. Krandick, K. Mehlhorn, S. Schmitt et al., A Descartes Algorithm for Polynomials with Bit-Stream Coefficients, CASC'2005, pp.38-149, 2005.
DOI : 10.1007/11555964_12

A. Eigenwillig, V. Sharma, and C. K. Yap, Almost tight recursion tree bounds for the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.71-78, 2006.
DOI : 10.1145/1145768.1145786

M. Elkadi and B. Mourrain, Algorithms for residues and Lojasiewicz exponents, Journal of Pure and Applied Algebra, vol.153, issue.1, pp.27-44, 2000.
DOI : 10.1016/S0022-4049(99)00083-3

I. Z. Emiris, On the Complexity of Sparse Elimination, Journal of Complexity, vol.12, issue.2, pp.134-166, 1996.
DOI : 10.1006/jcom.1996.0010

I. Z. Emiris, Matrix Methods for Solving Algebraic Systems, In Symbolic Algebraic Methods and Verification Methods, pp.69-78, 2001.

I. Z. Emiris and J. F. Canny, Efficient Incremental Algorithms for the Sparse Resultant and the Mixed Volume, Journal of Symbolic Computation, vol.20, issue.2, pp.117-149, 1995.
DOI : 10.1006/jsco.1995.1041

I. Z. Emiris, A. Galligo, and E. P. Tsigaridas, Random polynomials and expected complexity of bisection methods for real solving, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.235-242, 2010.
DOI : 10.1145/1837934.1837980
URL : https://hal.archives-ouvertes.fr/inria-00482722

I. Z. Emiris and C. Konaxis, Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants, Journal of Symbolic Computation, vol.46, issue.8, pp.919-942, 2011.
DOI : 10.1016/j.jsc.2011.02.002

I. Z. Emiris and A. Mantzaflaris, Multihomogeneous resultant matrices for systems with scaled support, Proc. ISSAC, pp.143-150, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00355881

I. Z. Emiris and B. Mourrain, Matrices in Elimination Theory, Journal of Symbolic Computation, vol.28, issue.1-2, pp.3-44, 1999.
DOI : 10.1006/jsco.1998.0266

I. Z. Emiris, B. Mourrain, and V. Y. Pan, Preface, Special Issue on Algebraic and Numerical Algorithms, pp.307-672, 2004.
DOI : 10.1016/j.tcs.2004.01.018

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, Real Algebraic Numbers: Complexity Analysis and Experimentation, Reliable Implementations of Real Number Algorithms: Theory and Practice, 2007.
DOI : 10.1007/978-3-540-85521-7_4

I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas, The DMM bound, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.242-250, 2010.
DOI : 10.1145/1837934.1837981
URL : https://hal.archives-ouvertes.fr/inria-00393833

I. Z. Emiris and V. Y. Pan, Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices, Journal of Symbolic Computation, vol.33, issue.4, pp.393-413, 2002.
DOI : 10.1006/jsco.2002.0520

I. Z. Emiris and V. Y. Pan, Improved algorithms for computing determinants and resultants, Also Proc. CASC'03, pp.43-71, 2003.
DOI : 10.1016/j.jco.2004.03.003

I. Z. Emiris and G. M. Tzoumas, Exact and efficient evaluation of the InCircle predicate for parametric ellipses and smooth convex objects, Computer-Aided Design, vol.40, issue.6, pp.691-700, 2008.
DOI : 10.1016/j.cad.2008.05.001

J. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

J. Faugère, A new efficient algorithm for computing Gröbner bases w/o Reduction to Zero (F5), Proc. ISSAC, pp.75-83, 2002.

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère and D. Lazard, The Combinatorial Classes of Parallel Manipulators . Mechanism and Machine Theory, pp.765-776, 1995.

J. Faugère, F. Levy-dit-vehel, and L. Perret, Cryptanalysis of MinRank, Proc. CRYPTO, pp.280-296, 2008.
DOI : 10.1007/978-3-540-85174-5_16

S. Fortune, An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials, Journal of Symbolic Computation, vol.33, issue.5, pp.627-646, 2002.
DOI : 10.1006/jsco.2002.0526

L. V. Foster, Generalizations of Laguerre???s Method: Higher Order Methods, SIAM Journal on Numerical Analysis, vol.18, issue.6, pp.1004-1018, 1981.
DOI : 10.1137/0718069

B. S. Garbow, Matrix Eigensystem Routines: EISPACK Guide Extension, 1972.
DOI : 10.1007/3-540-08254-9

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

A. George, J. W. Liu, and -. , Computer Solution of Large Sparse Positive Definite Linear Systems, 1981.

J. R. Gilbert and R. Schreiber, Highly Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.5, pp.1151-1172, 1992.
DOI : 10.1137/0913067
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2953

J. R. Gilbert and R. E. Tarjan, The analysis of a nested dissection algorithm, Numerische Mathematik, vol.2, issue.4, pp.377-404, 1987.
DOI : 10.1007/BF01396660

A. Greenbaum, Iterative Methods for Solving Linear Systems, 1997.
DOI : 10.1137/1.9781611970937

G. Greuel and G. Pfister, A Singular Introduction to Commutative Algebra (with contributions by

N. Halko, P. G. Martinsson, and J. A. Tropp, Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions, SIAM Review, vol.53, issue.2, pp.217-288, 2011.
DOI : 10.1137/090771806

E. Hansen, M. Patrick, and J. Rusnak, Some modifications of Laguerre's method, BIT, vol.27, issue.4, pp.409-417, 1977.
DOI : 10.1007/BF01933450

M. T. Heath, E. Ng, and B. W. Peyton, Parallel Algorithms for Sparse Linear Systems, SIAM Review, vol.33, issue.3, pp.420-460, 1991.
DOI : 10.1137/1033099

M. Hemmer, E. P. Tsigaridas, Z. Zafeirakopoulos, I. Z. Emiris, M. Karavelas et al., Experimental evaluation and cross-benchmarking of univariate real solvers, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, 2009.
DOI : 10.1145/1577190.1577202
URL : https://hal.archives-ouvertes.fr/inria-00340887

N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2002.
DOI : 10.1137/1.9780898718027

C. M. Hoffmann, J. R. Sendra, and F. Winkler, Special Issue on Parametric Algebraic Curves and Applications, J. Symbolic Comp, vol.23, 1997.

M. A. Jenkins and J. F. Traub, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration, Numerische Mathematik, vol.13, issue.3, pp.252-263, 1970.
DOI : 10.1007/BF02163334

J. Jouanolou, Formes d'inertie et r??sultant: un formulaire, Advances in Mathematics, vol.126, issue.2, pp.119-250288, 1992.
DOI : 10.1006/aima.1996.1609
URL : http://doi.org/10.1006/aima.1996.1609

E. Kaltofen and V. Y. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.180-191, 1991.
DOI : 10.1145/113379.113396

E. Kaltofen and V. Y. Pan, Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.714-723, 1992.
DOI : 10.1109/SFCS.1992.267779

E. Kaltofen and G. Villard, Computing the sign or the value of the determinant of an integer matrix, a complexity survey, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.133-146, 2004.
DOI : 10.1016/j.cam.2003.08.019

I. Kaporin, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Theoretical Computer Science, vol.315, issue.2-3, pp.469-510
DOI : 10.1016/j.tcs.2004.01.004

D. Kapur, Geometry theorem proving using Hilbert's Nullstellensatz, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation , SYMSAC '86, pp.399-408, 1986.
DOI : 10.1145/32439.32479

D. Kapur and Y. N. Lakshman, Elimination methods an introduction. In Symbolic and Numerical Computation for Artificial Intelligence, 1992.

D. Kapur and T. Saxena, Comparison of various multivariate resultant formulations, Proceedings of the 1995 international symposium on Symbolic and algebraic computation , ISSAC '95, pp.187-195, 1995.
DOI : 10.1145/220346.220370

A. Khetan, The resultant of an unmixed bivariate system, Journal of Symbolic Computation, vol.36, issue.3-4, pp.425-442, 2003.
DOI : 10.1016/S0747-7171(03)00089-0

P. Kirrinnis, Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z], Journal of Complexity, vol.14, issue.3, pp.378-444, 1998.
DOI : 10.1006/jcom.1998.0481

T. G. Kolda and B. W. Bader, Tensor Decompositions and Applications, SIAM Review, vol.51, issue.3, pp.455-500, 2009.
DOI : 10.1137/07070111X

I. Kotsireas, B. Mourrain, and V. Y. Pan, Preface, Theoretical Computer Science, vol.412, issue.16, pp.1443-1543, 2011.
DOI : 10.1016/j.tcs.2010.12.002

M. Kreuzer, R. , and L. , Computational Commutative Algebra 1, 2000.
DOI : 10.1007/978-3-540-70628-1

J. Laderman, V. Y. Pan, and H. X. Sha, On practical algorithms for accelerated matrix multiplication, Linear Algebra and its Applications, vol.162, issue.164, pp.162-164, 1992.
DOI : 10.1016/0024-3795(92)90393-O

Y. N. Lakshman and B. D. Saunders, Sparse Polynomial Interpolation in Nonstandard Bases, SIAM Journal on Computing, vol.24, issue.2, pp.387-397, 1995.
DOI : 10.1137/S0097539792237784

C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Prentice- Hall, NJ, 1974, and (with a survey of recent developments) SIAM, 1995.

D. Lazard, Resolution des systemes d'equations algebriques, Theoretical Computer Science, vol.15, issue.1, pp.77-110, 1981.
DOI : 10.1016/0304-3975(81)90064-5

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318

T. Lickteig and M. Roy, Sylvester???Habicht Sequences and Fast Cauchy Index Computation, Journal of Symbolic Computation, vol.31, issue.3, pp.315-341, 2001.
DOI : 10.1006/jsco.2000.0427
URL : http://doi.org/10.1006/jsco.2000.0427

R. J. Lipton, D. Rose, and R. E. Tarjan, Generalized Nested Dissection, SIAM Journal on Numerical Analysis, vol.16, issue.2, pp.346-358, 1979.
DOI : 10.1137/0716027

F. S. Macaulay, Algebraic theory of modular systems, Cambridge Tracts, vol.19, 1916.

K. Madsen, A root-finding algorithm based on Newton's method. BIT, pp.71-75, 1973.

M. W. Mahoney, M. Maggioni, and P. Drineas, Tensor-CUR Decompositions for Tensor-Based Data, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.957-987, 2008.
DOI : 10.1137/060665336

D. Manocha, Algebraic and Numeric Techniques for Modeling and Robotics, 1992.

E. W. Mayr and A. R. Meyer, The Complexity of the Finite Containment Problem for Petri Nets, Journal of the ACM, vol.28, issue.3, pp.561-576, 1981.
DOI : 10.1145/322261.322271

J. M. Mcnamee, A supplementary bibliography on roots of polynomials, Journal of Computational and Applied Mathematics, vol.78, issue.1, pp.433-434, 2000.
DOI : 10.1016/S0377-0427(96)00147-1

J. M. Mcnamee, Numerical Methods for Roots of Polynomials, 2007.

J. M. Mcnamee and V. Y. Pan, Efficient polynomial root-refiners: A survey and new record efficiency estimates, Computers & Mathematics with Applications, vol.63, issue.1, pp.239-254, 2012.
DOI : 10.1016/j.camwa.2011.11.015

J. M. Mcnamee and V. Y. Pan, Numerical Methods for Roots of Polynomials

K. Mehlhorn and S. Ray, Faster algorithms for computing Hong???s bound on absolute positiveness, Journal of Symbolic Computation, vol.45, issue.6, pp.677-683, 2010.
DOI : 10.1016/j.jsc.2010.02.002

K. Mehlhorn and M. Sagraloff, A deterministic algorithm for isolating real roots of a real polynomial, Journal of Symbolic Computation, vol.46, issue.1, pp.70-90, 2011.
DOI : 10.1016/j.jsc.2010.09.004

M. Mignotte, Mathematics for Computer Algebra, 1992.
DOI : 10.1007/978-1-4613-9171-5

M. Mignotte and D. Stefanescu, Polynomials: An algorithmic approach, 1999.

W. L. Miranker and V. Y. Pan, Methods of aggregation, Linear Algebra and its Applications, vol.29, pp.231-257, 1980.
DOI : 10.1016/0024-3795(80)90245-1

B. Mourrain and V. Y. Pan, Asymptotic acceleration of solving polynomial systems, Proc. STOC'98, pp.488-496, 1998.

B. Mourrain and V. Y. Pan, Multivariate Polynomials, Duality, and Structured Matrices, Journal of Complexity, vol.16, issue.1, pp.110-180, 2000.
DOI : 10.1006/jcom.1999.0530
URL : https://hal.archives-ouvertes.fr/hal-00739512

B. Mourrain, V. Y. Pan, and O. Ruatta, Accelerated Solution of Multivariate Polynomial Systems of Equations, SIAM Journal on Computing, vol.32, issue.2, pp.435-454, 2003.
DOI : 10.1137/S0097539701385168

B. Mourrain, J. Pavone, P. Trébuchet, and E. P. Tsigaridas, synaps: a library for symbolic-numeric computing, Proc. 8th Int. Symp. Effective Methods in Alg. Geom. (MEGA), Italy, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00178498

B. Mourrain and P. Trébuchet, Solving projective complete intersection faster, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.679-699, 2002.
DOI : 10.1145/345542.345642
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7274

B. Mourrain and P. Trébuchet, Stable normal forms for polynomial system solving Theor, Comp. Science, vol.409, issue.2, pp.229-240, 2008.
DOI : 10.1016/j.tcs.2008.09.004
URL : http://doi.org/10.1016/j.tcs.2008.09.004

B. Mourrain, M. Vrahatis, and J. C. Yakoubsohn, On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree, Journal of Complexity, vol.18, issue.2, 2002.
DOI : 10.1006/jcom.2001.0636

C. A. Neff and J. H. Reif, An O(n l+ ) algorithm for the complex root problem, Proc. IEEE FOCS, pp.540-547, 1994.

P. Q. Nguyen and B. Valle, The LLL Algorithm, Survey and Applications . Series: Information Security and Cryptography, XIV, 496 pp, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01141414

J. M. Ortega and R. G. Voight, Solution of Partial Differential Equations on Vector and Parallel Computers, SIAM Review, vol.27, issue.2, pp.149-240, 1985.
DOI : 10.1137/1027055

I. V. Oseledets and E. E. Tyrtyshnikov, Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions, SIAM Journal on Scientific Computing, vol.31, issue.5, pp.31-3744, 2009.
DOI : 10.1137/090748330

V. Y. Pan, On schemes for the evaluation of products and inverses of matrices, Uspekhi Mat. Nauk, pp.249-250, 1972.

V. Y. Pan, Strassen's algorithm is not optimal. Trilinear technique of aggregating, Proc. IEEE FOCS, pp.166-176, 1978.

V. Y. Pan, How can we speed up matrix multiplication? SIAM Rev, pp.393-415, 1984.

V. Y. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science, vol.179, 1984.
DOI : 10.1007/3-540-13866-8

V. Y. Pan, Complexity of parallel matrix computations, Theoretical Computer Science, vol.54, issue.1, pp.65-85, 1987.
DOI : 10.1016/0304-3975(87)90019-3

V. Y. Pan, Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Information Processing Letters, vol.28, issue.2, pp.71-75, 1988.
DOI : 10.1016/0020-0190(88)90166-4

V. Y. Pan, On computations with dense structured matrices, Also Proc. ISSAC, pp.179-190, 1989.
DOI : 10.1090/S0025-5718-1990-1023051-7

V. Y. Pan, Complexity of Computations with Matrices and Polynomials, SIAM Review, vol.34, issue.2, pp.225-262, 1992.
DOI : 10.1137/1034049

V. Y. Pan, Parallel solution of sparse linear and path systems In Synthesis of Parallel Algorithms, pp.621-678, 1993.

V. Y. Pan, Parallel computation of a Krylov matrix for a sparse and structured input, Mathematical and Computer Modelling, vol.21, issue.11, pp.97-99, 1995.
DOI : 10.1016/0895-7177(95)00084-F

V. Y. Pan, Optimal and nearly optimal algorithms for approximating polynomial zeros, Also STOC'95, pp.31-97, 1995.
DOI : 10.1016/0898-1221(96)00080-6

V. Y. Pan, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Theoretical Computer Science, vol.162, issue.2, pp.173-223, 1996.
DOI : 10.1016/0304-3975(96)00030-8

V. Y. Pan, Solving a Polynomial Equation: Some History and Recent Progress, SIAM Review, vol.39, issue.2, pp.187-220, 1997.
DOI : 10.1137/S0036144595288554

V. Y. Pan, Solving Polynomials with Computers, American Scientist, vol.86, issue.1, pp.62-69, 1998.
DOI : 10.1511/1998.17.915

V. Y. Pan, Some recent algebraic/numerical algorithms, Electronic Proc. IMACS/ACA'98, 1998.

V. Y. Pan, Numerical computation of a polynomial GCD and extensions. Information and Computation, Also Proc. SODA'98, pp.71-85, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073729

V. Y. Pan, Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration, Journal of Complexity, vol.16, issue.1, pp.213-264, 2000.
DOI : 10.1006/jcom.1999.0532
URL : http://doi.org/10.1006/jcom.1999.0532

V. Y. Pan, Structured Matrices and Polynomials: Unified Superfast Algorithms, 2001.
DOI : 10.1007/978-1-4612-0129-8

V. Y. Pan, Univariate polynomials, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.701-733, 2002.
DOI : 10.1145/384101.384136

V. Y. Pan, On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix, Journal of Mathematical Sciences, vol.134, issue.5, pp.163-187, 2004.
DOI : 10.1007/s10958-006-0118-6

V. Y. Pan, The amended DSeSC power method for polynomial root-finding, Computers & Mathematics with Applications, vol.49, issue.9-10, pp.9-10, 2005.
DOI : 10.1016/j.camwa.2004.09.011

V. Y. Pan, Newton's Iteration for Matrix Inversion, Advances and Extensions, Matrix Methods: Theory, Algorithms and Applications, pp.364-381, 2010.
DOI : 10.1142/9789812836021_0024

V. Y. Pan, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Computers & Mathematics with Applications, vol.62, issue.4, pp.1685-1706, 2011.
DOI : 10.1016/j.camwa.2011.06.006

V. Y. Pan, Root-Refining for a Polynomial Equation, Proceedings of CASC 2012, 2012.
DOI : 10.1007/978-3-642-32973-9_24

V. Y. Pan, S. Branham, R. Rosholt, and A. Zheng, Newton's iteration for structured matrices and linear systems of equations, pp.189-210

V. Y. Pan, D. Grady, B. Murphy, G. Qian, and R. E. Rosholt, Schur aggregation for linear systems and determinants, Theoretical Computer Science, vol.409, issue.2, pp.255-268
DOI : 10.1016/j.tcs.2008.09.005

V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, Y. Tang et al., Root-Finding with Eigen-Solving, pp.185-210
DOI : 10.1007/978-3-7643-7984-1_12

V. Y. Pan, D. Ivolgin, B. Murphy, R. E. Rosholt, Y. Tang et al., Additive preconditioning for matrix computations, Linear Algebra and Applications, pp.1070-1089, 2010.

V. Y. Pan, M. Kunin, R. E. Rosholt, and H. Kodal, Homotopic residual correction processes, Mathematics of Computation, vol.75, issue.253, pp.345-368, 2006.
DOI : 10.1090/S0025-5718-05-01771-0

V. Y. Pan, E. Landowne, and A. Sadikou, Univariate polynomial division with a remainder by means of evaluation and interpolation, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp.149-153, 1992.
DOI : 10.1109/SPDP.1991.218277

V. Y. Pan, B. Murphy, and R. E. Rosholt, Unified nearly optimal algorithms for structured integer matrices. Operator Theory: Advances and Applications, pp.359-375, 2010.

V. Y. Pan and F. P. Preparata, Work-Preserving Speed-Up of Parallel Matrix Computations, SIAM Journal on Computing, vol.24, issue.4, pp.811-821, 1995.
DOI : 10.1137/0224051

V. Y. Pan and G. Qian, Randomized preprocessing of homogeneous linear systems of equations. Linear Algebra and Applications, pp.3272-3318, 2010.

V. Y. Pan and G. Qian, Randomization, augmentation and aggregation in matrix computations, Linear Algebra and Its Applications

V. Y. Pan, G. Qian, and A. Zheng, Randomized preconditioning of the MBA algorithm, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.281-288, 2011.
DOI : 10.1145/1993886.1993929

V. Y. Pan, G. Qian, and A. Zheng, Randomized preprocessing versus pivoting, Linear Algebra and its Applications, vol.438, issue.4
DOI : 10.1016/j.laa.2011.02.052

V. Y. Pan, G. Qian, and A. Zheng, Real and complex polynomial root-finding via eigen-solving and randomization, Proc. CASC 2012, 2012.

V. Y. Pan, G. Qian, and A. Zheng, Randomized matrix computations, Ph.D. Program in Computer Science, 2012.

V. Y. Pan, G. Qian, A. Zheng, and Z. Chen, Matrix computations and polynomial root-finding with preprocessing, Linear Algebra and its Applications, vol.434, issue.4, pp.854-879, 2011.
DOI : 10.1016/j.laa.2010.04.011

V. Y. Pan, Y. Rami, and X. Wang, 7. Newton's Iteration for Structured Matrices, pp.233-265, 2002.
DOI : 10.1137/1.9781611971354.ch7
URL : https://hal.archives-ouvertes.fr/in2p3-00566280

V. Y. Pan and J. H. Reif, Compact Multigrid, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.1, pp.119-127, 1992.
DOI : 10.1137/0913007

V. Y. Pan and J. H. Reif, Fast and Efficient Parallel Solution of Sparse Linear Systems, SIAM Journal on Computing, vol.22, issue.6, pp.1227-1250, 1993.
DOI : 10.1137/0222073

V. Y. Pan and R. Schreiber, An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications, SIAM Journal on Scientific and Statistical Computing, vol.12, issue.5, pp.1109-1131, 1991.
DOI : 10.1137/0912058

V. Y. Pan and X. Wang, Inversion of Displacement Operators, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.3, pp.660-677, 2003.
DOI : 10.1137/S089547980238627X

V. Y. Pan and X. Wang, Degeneration of structured integer matrices modulo an integer, Linear Algebra and its Applications, vol.429, issue.8-9, pp.2113-2130, 2008.
DOI : 10.1016/j.laa.2008.06.020

V. Y. Pan and Y. Yu, Certification of Numerical Computation of the Sign of the Determinant of a Matrix, Also Proc. SODA '99, pp.708-724, 1999.
DOI : 10.1007/s00453-001-0032-8

V. Y. Pan and X. Yan, Additive preconditioning, eigenspaces, and the inverse iteration. Linear Algebra & Its Applications, pp.186-203, 2009.

V. Y. Pan and A. Zheng, New progress in real and complex polynomial root-finding, Computers & Mathematics with Applications, vol.61, issue.5, pp.1305-1334
DOI : 10.1016/j.camwa.2010.12.070

V. Y. Pan and A. Zheng, Root-finding by expansion with independent constraints, Computers & Mathematics with Applications, vol.62, issue.8, pp.3164-3182, 2011.
DOI : 10.1016/j.camwa.2011.08.029

B. Parlett, Symmetric Eigenvalue Problem, 1980.
DOI : 10.1137/1.9781611971163

M. J. Quinn, Parallel Computing: Theory and Practice, 1994.

M. Raghavan and B. Roth, Solving Polynomial Systems for the Kinematic Analysis and Synthesis of Mechanisms and Robot Manipulators, Journal of Mechanical Design, vol.117, issue.B, pp.71-79, 1995.
DOI : 10.1115/1.2836473

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.233-240, 1997.
DOI : 10.1145/258726.258792

F. Rouillier, Solving Zero-Dimensional Systems Through the Rational Univariate Representation, Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
DOI : 10.1007/s002000050114
URL : https://hal.archives-ouvertes.fr/inria-00073264

F. Rouillier and P. Zimmermann, Efficient isolation of polynomial's real roots, Journal of Computational and Applied Mathematics, vol.162, issue.1, pp.33-50, 2004.
DOI : 10.1016/j.cam.2003.08.015

M. Sagraloff, When Newton meets Descartes, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, 2011.
DOI : 10.1145/2442829.2442872

A. Sankar, D. Spielman, and S. Teng, Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices, SIAM Journal on Matrix Analysis and Applications, vol.28, issue.2, pp.446-476, 2006.
DOI : 10.1137/S0895479803436202

A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Math. Dept, 1982.

V. Sharma, Complexity of real root isolation using continued fractions, Theoretical Computer Science, vol.409, issue.2, pp.292-310, 2008.
DOI : 10.1016/j.tcs.2008.09.017
URL : https://hal.archives-ouvertes.fr/inria-00190865

A. Storjohann, The shifted number system for fast linear algebra on integer matrices, Journal of Complexity, vol.21, issue.4, pp.609-650, 2005.
DOI : 10.1016/j.jco.2005.04.002

A. J. Stothers, On the Complexity of Matrix Multiplication, 2010.

B. Sturmfels, Sparse elimination theory, Proc. Comp.. Alg, 1991.

R. E. Tarjan, A Unified Approach to Path Problems, Journal of the ACM, vol.28, issue.3, pp.577-593, 1981.
DOI : 10.1145/322261.322272

E. P. Tsigaridas, Improved complexity bounds for real root isolation using Continued Fractions, Proc. 4th Int'l Conf. on Math. Aspects Comp, pp.226-237, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00524834

E. P. Tsigaridas and I. Z. Emiris, On the complexity of real root isolation using continued fractions, Theoretical Computer Science, vol.392, issue.1-3, pp.158-173, 2008.
DOI : 10.1016/j.tcs.2007.10.010
URL : https://hal.archives-ouvertes.fr/inria-00116990

V. Barel, M. Vandebril, R. Van-dooren, P. Frederix, and K. , Implicit double shift QR-algorithm for companion matrices, Numerische Mathematik, vol.30, issue.8, pp.177-212, 2010.
DOI : 10.1007/s00211-010-0302-y

H. A. Van-der-vorst, Iterative Krylov Methods for Large Linear Systems, 2003.
DOI : 10.1017/CBO9780511615115

V. Williams and V. , Multiplying matrices faster than Coppersmith? Winograd. STOC 2012, 887?898 and Breaking the Coppersmith? Winograd barrier, 2011.

A. J. Vincent, Sur la résolution deséquationsdeséquations numériques, J. Math. Pures Appl, vol.1, pp.341-372, 1836.

X. Wang and V. Y. Pan, Acceleration of Euclidean Algorithm and Rational Number Reconstruction, SIAM Journal on Computing, vol.32, issue.2, pp.548-556, 2003.
DOI : 10.1137/S0097539702408636

D. S. Watkins, The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods, SIAM, 2007.
DOI : 10.1137/1.9780898717808

D. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137

J. H. Wilkinson, The Algebraic Eigenvalue Problem, 1965.

F. Winkler, Polynomial Algorithms in Computer Algebra, 1996.

W. Wu, Basis principles of mechanical theorem proving in elementary geometries, J. Syst. Sci. and Math Sci, vol.4, issue.3, pp.207-235, 1984.

C. K. Yap, Fundamental Problems of Algorithmic Algebra, 2000.

P. Zhlobich, Differential qd Algorithm with Shifts for Rank-Structured Matrices, SIAM Journal on Matrix Analysis and Applications, vol.33, issue.4
DOI : 10.1137/110857155