M. Daumas, C. Mazenc, X. Merrheim, and J. M. Muller, Modular Range Reduction: a New Algorithm for Fast and Accurate Computation of the Elementary Functions, J. Universal Computer Science, vol.1, issue.3, pp.162-175, 1995.
DOI : 10.1007/978-3-642-80350-5_15

M. Hata, Legendre Type Polynomials and Rationality Measures, J. reine angew. Math, vol.407, pp.99-125, 1990.

M. Hata, Rational Approximations to and Some Other Numbers, Acta Arithmetica, vol.63, issue.4, pp.335-349, 1993.

W. Kahan, Minimizing q*m-n, 1983.

A. and Y. Khintchine, Einige S???tze ???ber Kettenbr???che, mit Anwendungen auf die Theorie der Diophantischen Approximationen, Mathematische Annalen, vol.71, issue.1-2, pp.115-125, 1924.
DOI : 10.1007/BF01448437

D. Knuth, The Art of Computer Programming, 1973.

L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences. Pure and Applied Mathematics, 1974.

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

K. C. Ng, Argument Reduction for Huge Arguments: Good to the Last Bit, technical report, 1992.

M. Payne and R. Hanek, Radian reduction for trigonometric functions, ACM SIGNUM Newsletter, vol.18, issue.1, pp.19-24, 1983.
DOI : 10.1145/1057600.1057602

R. A. Smith, A continued-fraction analysis of trigonometric argument reduction, IEEE Transactions on Computers, vol.44, issue.11, pp.1348-1351, 1995.
DOI : 10.1109/12.475133