Scanning polyhedra with do loops, Proceedings of the 3rd ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP'91), 1991. ,
URL : https://hal.archives-ouvertes.fr/hal-00752774
Polynomials and Polynomials Inequalities, Graduate Texts in Mathematics, vol.161, 1995. ,
DOI : 10.1007/978-1-4612-0793-1
CONSTRUCTION OF DO LOOPS FROM SYSTEMS OF AFFINE CONSTRAINTS, Parallel Processing Letters, vol.05, issue.03, pp.421-436, 1995. ,
DOI : 10.1142/S0129626495000394
Scientific Computing on Itanium-Based Systems, 2002. ,
Parametric integer programming, RAIRO - Operations Research, vol.22, issue.3, pp.243-268, 1988. ,
DOI : 10.1051/ro/1988220302431
PIP/Piplib, a parametric integer linear programming solver, 2003. ,
Chebyshev Polynomials in Numerical Analysis. Oxford Mathematical Handbooks, 1972. ,
GMP, the GNU multiple precision arithmetic library, version 4.1.2, 2002. ,
On integer Chebyshev polynomials, Mathematics of Computation, vol.66, issue.218, pp.763-770, 1997. ,
DOI : 10.1090/S0025-5718-97-00829-6
URL : https://hal.archives-ouvertes.fr/inria-00074042
Loop nest synthesis using the polyhedral library, 1994. ,
URL : https://hal.archives-ouvertes.fr/inria-00074384
IA-64 and Elementary Functions : Speed and Precision. Hewlett-Packard Professional Books, 2000. ,
Elementary Functions, Algorithms and Implementation, 1997. ,
URL : https://hal.archives-ouvertes.fr/ensl-00000008
Faithful powering computation using table look-up and a fused accumulation tree, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.40-58, 2001. ,
DOI : 10.1109/ARITH.2001.930102
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. ,
Chebyshev polynomials. From approximation theory to algebra Pure and Applied Mathematics, 1990. ,
Combinatorial optimization. Polyhedra and efficiency, Algorithms and Combinatorics, 2003. ,
New algorithms for improved transcendental functions on IA-64, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336), pp.4-11, 1999. ,
DOI : 10.1109/ARITH.1999.762822
Table-driven implementation of the exponential function in IEEE floating-point arithmetic, ACM Transactions on Mathematical Software, vol.15, issue.2, pp.144-157, 1989. ,
DOI : 10.1145/63522.214389
Table-driven implementation of the logarithm function in IEEE floating-point arithmetic, ACM Transactions on Mathematical Software, vol.16, issue.4, pp.378-400, 1990. ,
DOI : 10.1145/98267.98294
Table-lookup algorithms for elementary functions and their error analysis, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic, pp.232-236, 1991. ,
DOI : 10.1109/ARITH.1991.145565
Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic, ACM Transactions on Mathematical Software, vol.18, issue.2, pp.211-222, 1992. ,
DOI : 10.1145/146847.146928
High-performance architectures for elementary function generation, Proc. of the 15th IEEE Symposium on Computer Arithmetic (Arith-15), Burgess and Ciminiera, pp.136-146, 2001. ,