Guillaume Hanrot

I am a professor at ENS Lyon, and a member of the LIP lab.

I am a member of the Arenaire research group, which is also an INRIA project-team. I am also the vice-president of INRIA's Evaluation Committee.

I have been involved in the development of the mpfr library and, in a more minor way, of the PARI system. Both of these are free software. My scientific interests include algorithmic number theory (among which diophantine equations) and its applications. Among those, I have been working on problems in computer arithmetic and cryptology (jacobians of algebraic curves over finite fields, integer factoring, lattice basis reduction).

Until September 2005, I was associate professor at École polytechnique. , and until 2009 I was an INRIA researcher at INRIA Nancy Grand Est, and team leader of the Cacao project-team.

Contact information

Guillaume HANROT
LIP / ENS-Lyon 46, allée d'Italie F-69364 LYON
e-mail : Guillaume.Hanrot@ens-lyon .fr
PGP/GnuPG public key
Phone : (+33) (0)4 72 72 87 95
Fax : (+33) (0)4 72 72 80 80

Publication list

Journals

Yuri Bilu, Guillaume Hanrot, Solving Thue equations of high degree, J. Number Theory 60 (1996), 373--392.
Guillaume Hanrot, Résolution effective d'équations diophantiennes : algorithmes et applications, Thèse, Université Bordeaux 1 (1997).
Yuri Bilu, Guillaume Hanrot, Solving Superelliptic Diophantine Equations by Baker's method, Compositio Math. 112 (1998), 273--312.
Yuri Bilu, Guillaume Hanrot, Thue equations with composite fields, Acta Arith. 88 (1999) no 4, 311--326.
Guillaume Hanrot, Solving Thue equations without the full unit group, Math. Comp. 69 (2000), 395--405.
Guillaume Hanrot, Natarajan Saradha, Tarlok Shorey, Almost perfect powers in consecutive integers, Acta Arith. 99 (2001) no 1-3, 13--25.
Yuri Bilu, Guillaume Hanrot, Paul Voutier, Existence of primitive divisors of Lucas and Lehmer numbers. J. Reine Angew. Math. 539 (2001), 75--122. Preliminary version
Yann Bugeaud, Guillaume Hanrot, Un nouveau critère pour l'équation de Catalan, Mathematika 47 (2000), 63--73. Preliminary version
Yann Bugeaud, Guillaume Hanrot, Maurice Mignotte, Sur l'équation diophantienne (x^n - 1)/(x - 1) = y^q, III. Proc. London Math. Soc. 84 (2002) no 1, 59--78. Preliminary version
Guillaume Hanrot, Joël Rivat, Gérald Tenenbaum, Paul Zimmermann, Density results on floating-point invertible numbers, Theoret. Comput. Sci., 291 (2004), 135--141.
Guillaume Hanrot, Michel Quercia, Paul Zimmermann, The Middle Product Algorithm, I. Speeding up the division and square root of power series, Appl. Alg. Eng. Comm. Comp. 14 (2004), 415--438. Preliminary version
Guillaume Hanrot, Paul Zimmermann, A note on Mulders' short product, J. Symb. Comput. 37 (2004), 391--401. Preliminary version
David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, and Paul Zimmermann. Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic, Numerical Algorithms, 37 (2004), 367--375. Preliminary version
Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pelissier, Paul Zimmermann, Multiple-Precision Floating-Point Computation With Well-Defined Semantics: The MPFR Library. ACM TOMS, to appear.
Guillaume Hanrot, Gérald Tenenbaum, Jie Wu, Moyenne de certaines fonctions arithmétiques sur les entiers friables, Proc. London Math. Soc. (to appear).

International Conferences

Guillaume Hanrot, François Morain, Solvability by radicals from an algorithmic point of view, ISSAC 2001, 175--182. Version préliminaire
Nicolas Brisebarre, Guillaume Hanrot, Floating-point L^2 approximations to functions, Proceedings of the 18th Symposium in Computer Arithmetic, à paraître.
Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann, Worst Cases of a Periodic Function With Large Arguments, Proceedings of the 18th Symposium in Computer Arithmetic, to appear.
Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima, Paul Zimmermann, Time- and Space-Efficient Evaluation of Some Hypergeometric Constants, ISSAC 2007, to appear.
Guillaume Hanrot, Damien Stehlé, Improved analysis of Kannan's Shortest Lattice Vector Algorithm, Crypto'2007, to appear.
Laurent Théry, Guillaume Hanrot, Primality Proving with Elliptic Curves, TPHOL'2007, to appear.

Book chapters

Guillaume Hanrot, Quelques idées sur l'algorithmique des équations diophantiennes. In N. Berline, A. Plagne, C. Sabbah (Éds.), Théorie algorithmique des nombres et équations diophantiennes, journées X-UPS 2005, Ellipses.
Yann Bugeaud, Guillaume Hanrot, Maurice Mignotte. Applications of Linear Forms in Logarithms. Chapter 12. Dans H. Cohen, Number theory: Analytic and Modern Methods, Springer-Verlag Graduate Texts in Mathematics 240, to appear.

Proceedings volume edited.

Guillaume Hanrot, Paul Zimmermann (Eds.), Proceedings of the 7th Conference on Real Numbers and Computers (RNC'7). 151 pp.

Manuscripts and lecture notes

Guillaume Hanrot, Quelques algorithmes en arithmétique, mémoire d'habilitation à diriger des recherches (2005).
Robert Cori, Guillaume Hanrot, Jean-Marc Steyaert, Conception et analyse d'algorithmes. Cours de dernier semestre à l'École polytechnique (2001).

Last update on Oct. 15, 2009.