V. Lefèvre, Moyens arithmétiques pour un calcul fiable, 2000.

D. Stehlé, V. Lefèvre, and P. Zimmermann, Worst cases and lattice reduction, 16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings., pp.142-147, 2003.
DOI : 10.1109/ARITH.2003.1207672

D. Stehlé, V. Lefèvre, and P. Zimmermann, Searching worst cases of a one-variable function using lattice reduction, IEEE Transactions on Computers, vol.54, issue.3, pp.340-346, 2005.
DOI : 10.1109/TC.2005.55

F. Dinechin, J. Muller, B. Pasca, and A. Plesco, An FPGA architecture for solving the Table Maker's Dilemma, ASAP 2011, 22nd IEEE International Conference on Application-specific Systems, Architectures and Processors, pp.187-194, 2011.
DOI : 10.1109/ASAP.2011.6043267

V. Lefèvre, An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ???2, 1997.
DOI : 10.1007/978-94-017-1247-7_16

V. Lefèvre, New Results on the Distance between a Segment and Z??. Application to the Exact Rounding, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), pp.68-75, 2005.
DOI : 10.1109/ARITH.2005.32

V. Lefèvre, J. Muller, and A. Tisserand, Toward correctly rounded transcendentals, IEEE Transactions on Computers, vol.47, issue.11, pp.1235-1243, 1998.
DOI : 10.1109/12.736435

P. Alessandri and V. Berthé, Three distance theorems and combinatorics on words, Enseignement Mathématique, vol.44, pp.103-132, 1998.

K. Group, The OpenCL Specification Version 1.2, 2011.

M. Harris, Parallel prefix sum (scan) with CUDA, tech. rep, 2007.