M. Ben-or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88
DOI : 10.1145/62212.62241

B. Buchberger, Ein Algorithmus zum auffinden der Basiselemente des Restklassenringes nach einem null-dimensionalen Polynomideal, 1965.

B. Buchberger, Multidimensional Systems Theory , chapter Gröbner bases: an algorithmic method in polynomial ideal theory, Reidel, vol.6, pp.184-232, 1985.

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

J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, pp.297-301, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

J. Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, pp.1-361, 1999.

J. Faugère, A new efficient algorithm for computing gröbner bases without reduction to zero (f5)

D. Y. Grigoriev and M. Karpinski, The matching problem for bipartite graphs with polynomially bounded permanents is in NC, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.166-172, 1987.
DOI : 10.1109/SFCS.1987.56

E. Kaltofen and Y. N. Lakshman, Improved sparse multivariate polynomial interpolation algorithms, ISSAC '88: Proceedings of the international symposium on Symbolic and algebraic computation, pp.467-474, 1988.
DOI : 10.1007/3-540-51084-2_44
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.448

R. Moenck, Fast computation of GCDs, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.142-171, 1973.
DOI : 10.1145/800125.804045

L. Robbiano, Term orderings on the polynominal ring, European Conference on Computer Algebra, pp.513-517, 1985.

J. Van-der-hoeven, Lazy multiplication of formal power series, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.17-20, 1997.
DOI : 10.1145/258726.258738

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

J. Van-der-hoeven, Relaxed multiplication using the middle product, Proc. ISSAC '03, pp.143-147, 2003.

J. Van-der-hoeven, The truncated fourier transform and applications, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.290-296, 2004.
DOI : 10.1145/1005285.1005327

J. Van-der-hoeven, New algorithms for relaxed multiplication, Journal of Symbolic Computation, vol.42, issue.8, pp.792-802, 2007.
DOI : 10.1016/j.jsc.2007.04.004

J. Van-der-hoeven, From implicit to recursive equations, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00583125

J. Van-der-hoeven and G. Lecerf, On the bit-complexity of sparse polynomial and series multiplication, Journal of Symbolic Computation, vol.50, 2010.
DOI : 10.1016/j.jsc.2012.06.004
URL : https://hal.archives-ouvertes.fr/hal-00476223

J. Van-der-hoeven and G. Lecerf, On the complexity of blockwise polynomial multiplication, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00660454

J. Van-der-hoeven and É. Schost, Multi-point evaluation in higher dimensions, Applicable Algebra in Engineering, Communication and Computing, vol.25, issue.2, 2010.
DOI : 10.1007/s00200-012-0179-3
URL : https://hal.archives-ouvertes.fr/hal-00477659