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

E. Remes, Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation, C.R. Acad. Sci. Paris, vol.198, pp.2063-2065, 1934.

M. Ercegovac, A general method for evaluation of functions and computation in a digital computer, 1975.

R. Michard, A. Tisserand, and N. Veyrat-charvillon, ´ Etude statistique de l'activité de la fonction de sélection dans l'algorithme de E-méthode, " in 5 i` eme journées d'´ etudes Faible Tension Faible Consommation (FTFC), pp.61-65, 2005.

M. Ercegovac and T. Lang, Division and Square-Root Algorithms: Digit- Recurrence Algorithms and Implementations. Kluwer Academic, 1994.

M. Ercegovac, J. Muller, and A. Tisserand, FPGA implementation of polynomial evaluation algorithm, Field Programmable Gate Arrays for Fast Board Development and Reconfigurable Computing, pp.177-188, 1995.

F. De-dinechin and A. Tisserand, Some improvements on multipartite table methods, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.128-135, 2001.
DOI : 10.1109/ARITH.2001.930112
URL : https://hal.archives-ouvertes.fr/inria-00072577

N. Brisebarre and J. Muller, Functions approximable by E-fractions, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004., 2004.
DOI : 10.1109/ACSSC.2004.1399371

R. Michard, Scripts Use for the Synthesis and the Simulation of VHDL Circuits and Evaluation of the Power Consumption INRIA Available: http://hal.archives-ouvertes.fr/inria-00453250/PDF/RT-0381.pdf INRIA Centre de recherche INRIA Grenoble ? Rhône-Alpes 655, 2010.