J. Canny, I. Emiris, G. Cohen, T. Mora, and O. Moreno, An efficient algorithm for the sparse mixed resultant, Proc. Intern. Symp. Applied Algebra, Algebraic Algor. and Error-Corr. Codes, pp.89-104, 1993.
DOI : 10.1007/3-540-56686-4_36

D. Cox, J. Little, and D. Shea, Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, 1997.

D. Cox, J. Little, and D. Shea, Using Algebraic Geometry, 1997.
DOI : 10.1007/978-1-4757-6911-1

D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Graduate Texts in Math, vol.150, 1994.

M. Elkadi and B. Mourrain, Introduction à la résolution des systèmes polynomiaux, Mathématiques et Applications, vol.59, 2007.
DOI : 10.1007/978-3-540-71647-1

I. Z. Emiris and A. Rege, Monomial bases and polynomial system solving, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, pp.114-122, 1994.

I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants and Multidimensional Determinants, 1994.
DOI : 10.1007/978-0-8176-4771-1

S. Kaspar, Computing border bases without using a term ordering Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, pp.1-13, 2011.

A. Kehrein and M. Kreuzer, Characterizations of border bases, Journal of Pure and Applied Algebra, vol.196, issue.2-3, pp.251-270, 2005.
DOI : 10.1016/j.jpaa.2004.08.028

A. Kehrein and M. Kreuzer, Computing border bases, Journal of Pure and Applied Algebra, vol.205, issue.2, pp.279-295, 2006.
DOI : 10.1016/j.jpaa.2005.07.006
URL : http://doi.org/10.1016/j.jpaa.2005.07.006

M. Kreuzer and L. Robbiano, Computational Commutative Algebra 2, 2005.
DOI : 10.1007/978-3-540-70628-1

F. S. Macaulay, Some Formulae in Elimination, Proceedings of the London Mathematical Society, vol.1, issue.1, pp.3-27, 1902.
DOI : 10.1112/plms/s1-35.1.3

B. Mourrain, A New Criterion for Normal Form Algorithms, Proc. AAECC, pp.430-443, 1999.
DOI : 10.1007/3-540-46796-3_41

B. Mourrain, Symbolic-Numeric Computation, chapter Pythagore's Dilemma, Symbolic-Numeric Computation, and the Border Basis Method, pp.223-243, 2007.

B. Mourrain, . Ph, and . 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.231-238, 2000.
DOI : 10.1145/345542.345642
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7274

B. Mourrain, . Ph, and . Trébuchet, Generalised normal forms and polynomial system solving, International Conference on Symbolic and Algebraic Computation, pp.253-260, 2005.

B. Mourrain, . Ph, and . Trébuchet, Stable normal forms for polynomial system solving, Theoretical Computer Science, vol.409, issue.2, pp.229-240, 2008.
DOI : 10.1016/j.tcs.2008.09.004
URL : https://hal.archives-ouvertes.fr/inria-00343103

B. Mourrain, . Ph, and . Trébuchet, Border basis representation of a general quotient algebra, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.265-272, 2012.
DOI : 10.1145/2442829.2442868
URL : https://hal.archives-ouvertes.fr/hal-00709962

B. Sturmfels, Sparse elimination theory, Proc. Computat. Algebraic Geom. and Commut. Algebra 1991, pp.264-298, 1993.