A. Arnold, Sparse polynomial interpolation and testing, 2016.

A. Arnold and D. Roche, Output-sensitive algorithms for sumset and sparse polynomial multiplication, ISSAC'15, pp.29-36, 2015.

A. Arnold and D. S. Roche, Multivariate sparse interpolation using randomized Kronecker substitutions, ISSAC'14, pp.35-42, 2014.

M. Ben-or and P. Tiwari, A Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation, STOC'88, pp.301-309, 1988.

R. Cole and R. Hariharan, Verifying candidate matches in sparse and wildcard matching, STOC'02, pp.592-601, 2002.

P. Giorgi, A probabilistic algorithm for verifying polynomial middle product in linear time, Information Processing Letters, vol.139, pp.30-34, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01538453

D. Harvey, . Van-der, and J. Hoeven, Faster polynomial multiplication over finite fields using cyclotomic coefficient rings, J. Complexity, vol.54, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02350390

D. Harvey, . Van-der, and J. Hoeven, Integer multiplication in time, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02070778

J. V. Hoeven and G. Lecerf, On the bit-complexity of sparse polynomial and series multiplication, J. Symbolic Computation, vol.50, pp.227-254, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00476223

Q. Huang, Sparse polynomial interpolation over fields with large or zero characteristic, ISSAC'19, pp.219-226, 2019.

Q. Huang and X. Gao, Revisit Sparse Polynomial Interpolation Based on Randomized Kronecker Substitution, CASC'19, pp.215-235, 2019.

S. C. Johnson, Sparse polynomial arithmetic, ACM SIGSAM Bulletin, vol.8, pp.63-71, 1974.

M. Monagan and R. Pearce, Parallel sparse polynomial multiplication using heaps, p.263, 2009.

M. Monagan and R. Pearce, Sparse polynomial division using a heap, J. Symbolic Computation, vol.46, pp.807-822, 2011.

V. Nakos, Nearly optimal sparse polynomial multiplication, 2019.

D. A. Plaisted, New NP-hard and NP-complete polynomial and integer divisibility problems, Theoretical Computer Science, vol.31, pp.125-138, 1984.

R. Prony, Essai expérimental et analytique sur les lois de la dilatabilité de fluides élastique et sur celles de la force expansive de la vapeur de l'eau et de la vapeur de l'alkool, à différentes températures, J. de l'École Polytechnique, vol.1, pp.24-76, 1795.

D. S. Roche, Chunky and equal-spaced polynomial multiplication, J. Symbolic Computation, vol.46, pp.791-806, 2011.

D. S. Roche, What can (and can't) we do with sparse polynomials?, ISSAC'18, pp.25-30, 2018.

J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math, vol.6, pp.64-94, 1962.

V. Shoup, A Computational Introduction to Number Theory and Algebra, 2008.

. Van-der, J. Hoeven, R. Lebreton, and É. Schost, Structured FFT and TFT: Symmetric and Lattice Polynomials, ISSAC'13, pp.355-362, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00780431

. Van-der, J. Hoeven, and G. Lecerf, On the Complexity of Multivariate Blockwise Polynomial Multiplication, ISSAC'12, pp.211-218, 2012.
URL : https://hal.archives-ouvertes.fr/hal-02350502

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra, 2013.

A. C. Yao and .. , On the Evaluation of Powers, SIAM Journal on Computing, vol.5, pp.100-103, 1976.