Paul Zimmermann (born 13 November 1964) is a French computational mathematician, working at INRIA.
His doctoral degree from École Polytechnique in 1991 was entitled Séries génératrices et analyse automatique d’algorithmes,[1] and advised by Philippe Flajolet.
He has developed some of the fastest available code for manipulating polynomials over GF(2),[3] and for calculating hypergeometric constants to billions of decimal places.
[4] He is associated with the CARAMEL project to develop efficient arithmetic, in a general context and in particular in the context of algebraic curves of small genus; arithmetic on polynomials of very large degree turns out to be useful in algorithms for point-counting on such curves.
[8] He has been an active developer of the GMP-ECM implementation of the elliptic curve method for integer factorisation and of MPFR, an arbitrary precision floating point library with correct rounding.