Paul Zimmermann

: "For the American sportswriter, see Paul Zimmerman."

Paul Zimmermann is a French computational mathematician, working at INRIA.

His interests include asymptotically-fast arithmetic — he is writing a book [cite url | url=http://www.loria.fr/~zimmerma/mca/pub226.html |title=Modern Computer Arithmetic | author=P. Zimmermann |coauthor=R.Brent] on algorithms for computer arithmetic with Richard Brent. He has developed some of the fastest available code for manipulating polynomials over GF(2) [cite journal |title=Faster Multiplication in GF(2) [x] | author=Paul Zimmermann |coauthors=Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé |url=http://hal.inria.fr/inria-00188261/en |journal=Proceedings of ANTS-VIII |pages=153–166 |year=2008 ] , and for calculating hypergeometric constants to billions of decimal places [cite conference | title=Time- and Space-Efficient Evaluation of Some Hypergeometric Constants | conference= Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007 |year=2007 |pages=85-91 |editor=C W Brown |author=Paul Zimmermann |coauthors=Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima] . He is presently associated with the CACAO 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 has been an active developer of the GMP-ECM implementation of the elliptic curve method for integer factorisation.

Zimmermann's Erdős number is 2.

References

*Citation | last1=Flajolet | first1=Philippe | last2=Zimmerman | first2=Paul | last3=Van Cutsem | first3=Bernard | title=A calculus for the random generation of labelled combinatorial structures | doi=10.1016/0304-3975(94)90226-7 | id=MathSciNet | id = 1290534 | year=1994 | journal=Theoretical Computer Science | issn=0304-3975 | volume=132 | issue=1 | pages=1–35

External links

* http://www.loria.fr/~zimmerma/