INRIA researcher (Chargé de Recherche) at Loria (POLKA project, then SPACES project), then at the LIP / École Normale Supérieure de Lyon (Arénaire project, then AriC project).
PhD: Computer Arithmetic Tools for Reliable Computing, under the direction of Jean-Michel Muller, at the Laboratoire de l'Informatique du Parallélisme (École Normale Supérieure de Lyon). Defended on January 10, 2000.
Commitee: Paul Zimmermann, Jean-Marie Chesneaux (reporters); Brigitte Vallée, Peter Kornerup, Jean-Michel Muller (members).
Agrégation de Mathématiques.
DEA d'Informatique de Lyon, mention bien.
(See Appendix for contents.)
Magistère d'Informatique et Modélisation de l'École Normale Supérieure de Lyon, mention bien.
Maîtrise d'Informatique du Magistère de l'École Normale Supérieure de Lyon, mention assez bien.
[Master's degree in Mathematics and Computer Science, ENS Lyon.]
(See Appendix for contents.)
Licence d'Informatique du Magistère de l'École Normale Supérieure de Lyon, 1er, mention très bien.
[Bachelor's degree in Mathematics and Computer Science, ENS Lyon, ranked 1st, with distinction.]
(See Appendix for contents.)
Classes préparatoires aux Grandes Écoles (Pierre de Fermat, Toulouse).
Entrance to ENS Lyon.
Baccalauréat section C (mention bien).
[High School Diploma in Maths and Physics.]
[A Levels in Maths and Physics.]
A 6-week project on Digital Terrain Models and Virtual Reality under the direction of Jean-Pierre Jessel (Associate Professor) at the IRIT (Institut de Recherche en Informatique de Toulouse).
A 3-month training period on a Redundant Binary Representation of the Rationals based on Continued Fractions, under the direction of Pr Peter Kornerup, at Odense University (Denmark).
A 4-month training period on the Exact Rounding of the Elementary Functions, under the direction of Jean-Michel Muller, at the Laboratoire de l'Informatique du Parallélisme (École Normale Supérieure de Lyon).
International Championship of Mathematics Puzzles:
Ranked 1st in 1988 (category C2).
Ranked 2nd in 1991 (category L1).
Ranked 1st in 1993 (category L2).
Ranked 4th in 2000 (category HC).
Ranked 4th in 2006 (category HC).
Ranked 4th in 2010 (category HC).
Ranked 5th in 2011 (category HC).
Ranked 4th in 2012 (category HC).
Junior Fermat Math Award, 1991.
Concours Général de Mathématiques: 2nd prize (in 1991).
International Mathematical Olympiad:
3rd prize (bronze medal) in 1991 (in Sweden).
2nd prize (silver medal) in 1992 (in Russia).
Prix du Club Scientifique et Technologique de l'AETG (Association des Établissements du Technopôle de Gerland), 1999, for my PhD work Arrondi contrôlé des fonctions pour une meilleure fiabilité des logiciels numériques.
Loria's medal in 2005, as a member of the MPFR team, after we won the Many Digits Friendly Competition (Radboud University, Nijmegen, The Netherlands, October 3–4, 2005).
La Recherche award 2013 in the Computer science category (together with Peter Kornerup, Nicolas Louvet, and Jean-Michel Muller).
C, Pascal, Perl, shell scripts, ECMAScript, notions of Fortran.
Assembly languages: 6502, 680x0, Saturn, Sparc, ARM.
Scheme, RPL, notions of Prolog3, Eiffel3, notions of Smalltalk, XSLT.
University of Cambridge, International Examinations: First Certificate in English.
Notions.
Computing since 1982 (on Apple II, Atari ST, Acorn / RISC OS, and Unix systems).
Stays abroad: England, USA, Denmark, Germany.
Classical music (piano).
Algorithms and Advanced Algorithms.
Programming and Data Structures (Scheme, C, Pascal, Prolog).
Basic Systems and Basic Languages (Sparc).
Computer Architecture.
Integrated Circuits.
Operating Systems.
Image Synthesis and Analysis.
Automata and Formal Languages.
Logic.
Algebra and Theory of Numbers.
Parallel Architectures and Algorithms.
Parallel Programming.
Networks and Distributed Systems.
Object Oriented Languages (Eiffel, SmallTalk).
Compilation.
Image Analysis.
Discrete Mathematics.
Calculability and Complexity.
Scheduling Techniques.
Shape Recognition.
Real-time Architectures.
Calculability, Complexity.
Metaknowledge.
Computer Arithmetic.
Integrated Architectures Synthesis.
Cellular Automata.
Graphs and Orders.