This article has multiple issues. Please help
improve it or discuss these issues on the
talk page. (
Learn how and when to remove these template messages)
|
Paul Zimmermann (born 13 November 1964) is a French computational mathematician, working at INRIA.
Zimmermann co-authored the book Computational Mathematics with SageMath [1] used by Mathematical students worldwide.
His interests include asymptotically fast arithmetic—he wrote a book [2] on algorithms for computer arithmetic with Richard Brent. 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. He is also interested in computational number theory. In particular, he has contributed to some of the record computations in integer factorisation [5] and discrete logarithm. [6]
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. He is also a coauthor of the CADO-NFS software tool, which was used to factor RSA-240 in record time. [7]
In a 2014 blog post, [8] Zimmermann said that he would refuse invitations to review papers submitted to gold (author-pays) open access and hybrid open access journals, because he disagrees with the publication mechanism.