1. Andrew Arnold and Erich L. Kaltofen. 2015. Error-Correcting Sparse Interpolation in the Chebyshev Basis. In ISSAC’15 Proc. 2015 ACM Internat. Symp. Symbolic Algebraic Comput.Association for Computing Machinery, New York, N. Y., 21–28. URL: #1.
2. M. Ben-Or and P. Tiwari. 1988. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proc. Twentieth Annual ACM Symp. Theory Comput.ACM Press, New York, N.Y., 301–309.
3. On the decidability of sparse univariate polynomial interpolation
4. Matthew T. Comer, Erich L. Kaltofen, and Clément Pernet. 2012. Sparse Polynomial Interpolation and Berlekamp/Massey Algorithms That Correct Outlier Errors in Input Values. In ISSAC 2012 Proc. 37th Internat. Symp. Symbolic Algebraic Comput., Joris van der Hoeven and Mark van Hoeij (Eds.). Association for Computing Machinery, New York, N. Y., 138–145. URL: #1.
5. Generalized Vandermonde determinants and roots of unity of prime order