I am an INRIA researcher (Chargé de Recherche) at the Laboratoire de l'Informatique du Parallélisme (École Normale Supérieure de Lyon) in the Arénaire project. I previously was at Loria in the SPACES project.
You can see the list of my publications (with a link to the publication if it is available on the web) or download it in the bibtex format.
Information about the file formats of my slides.
The table maker's dilemma, Caen, France, March 1999 (in French): PDF, gzipped PS.
The table maker's dilemma, AOC workshop, November 2000 (in English): PDF, gzipped PS.
The table maker's dilemma, École de Printemps Arithmétique des Ordinateurs, Prapoutel, France, March 2001 (in French): PDF, gzipped PS.
Multiplication by an integer constant, AOC workshop, June 2001 (in French): PDF, gzipped PS.
MPFR (software demonstration), Computability and Complexity in Analysis workshop, Málaga, Spain, July 2002 (in English): PDF, gzipped PS.
Exhaustive tests of the elementary functions, Arinews workshop, November 2002 (in French): PDF, gzipped PS.
Exhaustive tests of the elementary functions, journées au vert SPACES, May 2003 (in French): PDF, gzipped PS.
Multiplication by an integer constant, lower bounds on the code length, RNC'5, École Normale Supérieure de Lyon, Lyon, France, September 2003 (in English): PDF, gzipped PS.
Exhaustive tests of the elementary functions, Arinews workshop, November 2003 (in French): PDF, gzipped PS.
Back on the algorithm that computes a lower bound on the distance between a segment and ℤ2, Arinews workshop, May 2004 (in French): PDF, gzipped PS. Associated HTML file: example.
Back on the algorithm that computes a lower bound on the distance between a segment and ℤ2, June 2004 (in French): PDF, gzipped PS. Associated HTML file: example.
The generic multiple-precision floating-point addition with correct rounding (as in the MPFR library), RNC'6, Schloß Dagstuhl, Germany, November 2004 (in English): PDF, gzipped PS.
The Euclidean division implemented with a floating-point division and a floor, Arinews workshop, March 2005 (in French): PDF, gzipped PS.
New results on the distance between a segment and ℤ2 — application to the exact rounding, Arith'17, June 2005: PDF, gzipped PS.
Worst cases for the exponential function in the IEEE 754r decimal64 format, JNAO, May/June 2006: PDF, gzipped PS.
Searching for some worst cases for the correct rounding of the power functions in double precision, Dagstuhl Seminar 08021 Numerical Validation in Current Hardware Architectures, January 2008: PDF.
Approximating a function f by polynomials to compute approximate successive values f(0), f(1), f(2)..., Arénaire workshop, March 2008 (in French): PDF.
SLZ algorithm and results.
Projet ANR EVA-Flo: Évaluation et Validation Automatique pour le calcul Flottant.
Arithmétique des Ordinateurs Certifiée (1999 - 2002).
About the IEEE-754 standard, and its revision (754R).
The GMP library.
The MPFR library (and also MPFR++ and MPFI). Try it online!
The Apfloat library.
iRRAM, exact arithmetic in C++.
Interval Computations pages.
Exact geometric computation web site and the Core library.
SCSLib, a fast and lightweight multiple-precision library supporting the four arithmetic operations, developed in the Arenaire project at ENS-Lyon (France); the precision (210 bits by default) is fixed at compile time.
Page generated from file research/index.en.xml on 2008-09-28 by xsltproc (using libxml 20632, libxslt 10124 and libexslt 813).
Note: this DocBook conversion is still experimental; please report any problem.