This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Paul Zimmermann (born 13 November 1964) is a French computational mathematician, working at INRIA.
Education
editAfter engineering studies at École Polytechnique 1984 to 1987, he got a master's degree in computer science in 1988 from University Paris VII and a magister from École Normale Supérieure in mathematics and computer science. 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.[2]
Research
editHis interests include asymptotically fast arithmetic.
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]
Zimmermann co-authored the book Computational Mathematics, published in 2018 on SageMath[7] used by Mathematical students worldwide.
In 2010, he co-authored a book on algorithms for computer arithmetic with Richard Brent.[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. He is also a coauthor of the CADO-NFS software tool, which was used to factor RSA-240 in record time.[9]
In a 2014 blog post,[10] 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.
References
edit- ^ CV, last accessed on 12 August 2024.
- ^ Paul Zimmermann at Math Genealogy
- ^ Zimmermann, Paul; Brent, Richard Peirce; Gaudry, Pierrick; Thomé, Emmanuel (2008). Poorten, Alfred J.; Stein, Andreas (eds.). "Faster Multiplication in GF(2)[x]". Proceedings of ANTS-VIII. Lecture Notes in Computer Science. 5011: 153–166. doi:10.1007/978-3-540-79456-1. ISBN 978-3-540-79455-4.
- ^ Zimmermann, Paul; Cheng, Howard; Hanrot, Guillaume; Thomé, Emmanuel; Zima, Eugene (2007). Brown, C. W. (ed.). Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007. pp. 85–91.
- ^ Cryptology ePrint Archive: Report 2010/006
- ^ Cryptology ePrint Archive: Report 2013/197
- ^ Zimmermann, Paul; Casamayou, Alexandre; Cohen, Nathann; Connan, Guillaume; Dumont, Thierry. "Computational Mathematics with SageMath".
- ^ Zimmermann, Paul; Brent, Richard Peirce. "Modern Computer Arithmetic".
- ^ "[Cado-NFS-discuss] 795-bit factoring and discrete logarithms". Archived from the original on 2019-12-03. Retrieved 2019-12-03.
- ^ Zimmermann, Paul. "Why I refuse to review papers submitted to open-access and hybrid journals?".
- Flajolet, Philippe; Zimmerman, Paul; Van Cutsem, Bernard (1994). "A calculus for the random generation of labelled combinatorial structures". Theoretical Computer Science. 132 (1): 1–35. doi:10.1016/0304-3975(94)90226-7. MR 1290534.
External links
edit
 | This article about a French mathematician is a stub. You can help Wikipedia by expanding it. |