S. Boldo and M. Daumas, A Simple Test Qualifying the Accuracy of Horner'S Rule for Polynomials, Numerical Algorithms, vol.37, issue.1-4, pp.45-60, 2004.
DOI : 10.1023/B:NUMA.0000049487.98618.61

N. Brisebarre and S. Chevillard, Efficient polynomial L-approximations, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.169-176, 2007.
DOI : 10.1109/ARITH.2007.17
URL : https://hal.archives-ouvertes.fr/inria-00119513

N. Brisebarre, J. Muller, and A. Tisserand, Computing machine-efficient polynomial approximations, ACM Transactions on Mathematical Software, vol.32, issue.2, pp.236-256, 2006.
DOI : 10.1145/1141885.1141890
URL : https://hal.archives-ouvertes.fr/ensl-00086826

E. W. Cheney, Introduction to Approximation Theory, 1966.

S. Chevillard and C. Lauter, A Certified Infinite Norm for the Implementation of Elementary Functions, Seventh International Conference on Quality Software (QSIC 2007), pp.153-160, 2007.
DOI : 10.1109/QSIC.2007.4385491
URL : https://hal.archives-ouvertes.fr/ensl-00119810

M. Cornea, J. Harrison, and P. T. Tang, Scientific Computing on Itanium-based Systems, 2002.

F. De-dinechin, C. Lauter, and J. Muller, Fast and correctly rounded logarithms in doubleprecision, Theoretical Informatics and Applications, pp.85-102, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070331

F. De-dinechin, C. Q. Lauter, and G. Melquiond, Assisted verification of elementary functions using Gappa, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, pp.1318-1322, 2006.
DOI : 10.1145/1141277.1141584

C. B. Dunham, Fitting approximations to the kuki-cody-waite form, International Journal of Computer Mathematics, vol.23, issue.3-4, pp.263-265, 1990.
DOI : 10.1080/00207168708803575

C. Finot-moreau, Preuves et algorithmes utilisant l'arithmétique flottante normalisée IEEE, 2001.

Y. Hida, X. S. Li, and D. H. Bailey, Algorithms for quad-double precision floating point arithmetic, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.155-162, 2001.
DOI : 10.1109/ARITH.2001.930115

D. Knuth, Seminumerical Algorithms, The Art of Computer Programming, 1997.

C. Lauter, Basic building blocks for a triple-double intermediate format, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070314

R. Li, P. Markstein, J. P. Okada, and J. W. Thomas, The libm library and floating-point arithmetic for HP-UX on Itanium, 2001.

P. Markstein, IA-64 and Elementary Functions : Speed and Precision. Hewlett-Packard Professional Books, 2000.

J. Muller, Elementary Functions, Algorithms and Implementation. Birkhäuser, 2006.
URL : https://hal.archives-ouvertes.fr/ensl-00000008

E. Y. Remez, Osnovy chislennykh metodov chebyshevskogo priblizheniya, Akademiya Nauk Ukrainskoy SSR, 1969.

G. Revy, Analyse et implantation d'algorithmes rapides pour l'´ evaluation polynomiale sur les nombres flottants, 2006.
URL : https://hal.archives-ouvertes.fr/ensl-00119498

R. Schaback and D. Braess, A method for solving the linear tchebycheff approximation problem when the haar condition is not satisfied, Computing, vol.1, issue.3-4, pp.289-294, 1970.
DOI : 10.1007/BF02238813