Paul Zimmermann (born November 13, 1964) is a French computational mathematician, working at INRIA.
His interests include asymptotically fast arithmetic—he wrote a book on algorithms for computer arithmetic with Richard Brent. He has developed some of the fastest available code for manipulating polynomials over GF(2), and for calculating hypergeometric constants to billions of decimal places. 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.
^Paul Zimmermann; Howard Cheng; Guillaume Hanrot; Emmanuel Thomé; Eugene Zima (2007). C W Brown, ed. "Time- and Space-Efficient Evaluation of Some Hypergeometric Constants". Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007. pp. 85–91.