Paul Zimmermann 's AcademicInfluence.com Rankings Paul Zimmermann 's Degrees Why Is Paul Zimmermann Influential? (Suggest an Edit or Addition)
According to Wikipedia , Paul Zimmermann is a French computational mathematician, working at INRIA. Zimmermann co-authored the book Computational Mathematics with SageMath used by Mathematical students worldwide. 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, 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. He is also interested in computational number theory. In particular, he has contributed to some of the record computations in integer factorisation and discrete logarithm.
(See a Problem?) Paul Zimmermann 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
1990 2000 2010 2020 0 125 250 375 500 625 750 875 1000 1125 1250 1375 1500 1625 Published Works IEEE Standard for Floating-Point Arithmetic (2008) MPFR: A multiple-precision binary floating-point library with correct rounding (2007) Factorization of a 768-Bit RSA Modulus (2010) Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice (2015) GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable (1994) A Calculus for the Random Generation of Labelled Combinatorial Structures (1994) Efficient isolation of polynomial's real roots (2004) Factorization of RSA-140 Using the Number Field Sieve (1999) Factorization of a 512-Bit RSA Modulus (2000) Modern Computer Arithmetic (2010) Automatic Average-Case Analysis of Algorithm (1991) Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic (1999) The Middle Product Algorithm I (2004) Faster Multiplication in GF(2)[x] (2008) A Binary Recursive Gcd Algorithm (2004) A Proof of GMP Square Root (2003) A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm (2007) 20 Years of ECM (2006) Searching worst cases of a one-variable function using lattice reduction (2005) Lambda-Upsilon-Omega the 1989 cookbook (1989) (40)An elementary digital plane recognition algorithm (2005) Computational Mathematics with SageMath (2018) The n-Queens Problem (1994) Automatic analysis (2000) Error bounds on complex floating-point multiplication (2007) Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials (2021) Discrete Logarithm in GF(2809) with FFS (2014) A long note on Mulders' short product (2004) A Calculus for the random generation of combinatorial structures (1993) (34)Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer (1988) Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (2020) MuPAD User’s Manual (1996) Speeding up the Division and Square Root of Power Series (2000) (27)Worst cases and lattice reduction (2003) Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic (2004) A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (2003) Random walks, heat equation and distributed algorithms (1994) ECRYPT Stream Cipher Project (2011) Finding Optimal Formulae for Bilinear Maps (2012) An O(M(n) logn) Algorithm for the Jacobi Symbol (2010) Factorisation of RSA-704 with CADO-NFS (2012) (23)Why and How to Use Arbitrary Precision (2010) The automatic complexity analysis of divide-and-conquer algorithms (1989) (21)Computing predecessor and successor in rounding to nearest (2009) Random Number Generators with Period Divisible by a Mersenne Prime (2003) Karatsuba Square Root (1999) (20)The great trinomial hunt (2010) (18)Vienna proposal for interval standardization (2008) (15)Ten new primitive binary trinomials (2008) Landau's function for one million billions (2008) Time-and space-efficient evaluation of some hypergeometric constants (2007) Factorization in Z[x]: the searching phase (2000) Better polynomials for GNFS (2015) Worst Cases of a Periodic Function for Large Arguments (2007) A Multi-level Blocking Distinct Degree Factorization Algorithm (2007) Non-linear polynomial selection for the number field sieve (2012) Reliable Computing with GNU MPFR (2010) Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format (2008) Factorisation of RSA-220 with CADO-NFS (2016) (11)CS: a MuPAD package for counting and randomly generating combinatorial structures (1998) (10)Ga A: a Package for the Random Genera- Tion of Combinatorial Structures (1994) (9)Imperfect forward secrecy (2018) Ballot stuffing in a postal voting system (2011) On Various Ways to Split a Floating-Point Number (2018) Gal's accurate tables method revisited (2005) A proof of GMP fast division and square root implementations (2000) (8)On sums of seven cubes (1999) Maximal determinants and saturated D-optimal designs of orders 19 and 37 (2011) (8)Optimized Binary64 and Binary128 Arithmetic with GNU MPFR (2017) Density results on floating-point invertible numbers (2003) A Calculus of Random Generation (1993) Parallelism in MuPAD (1997) A primitive trinomial of degree 6972593 (2004) Gaïa: a package for the random generation of combinatorial structures (1994) (6)Ten consecutive primes in arithmetic progression (2002) Accuracy of Mathematical Functions in Single, Double, Extended Double and Quadruple Precision (2021) (5)Average Case Analysis of Unification Algorithms (1991) Modern Computer Arithmetic (version 0.5.1) (2010) Guest editors' introduction: Special issue on practical development of exact real number computation (2005) A review of the ODE solvers of Maple, Mathematica, Macsyma and MuPAD (1995) (4)Polynomial Factorization Challenges (1996) (4)Analysis of functions with a finite number of return values (1992) (3)Uniform random generation for the powerset construction (1995) (3)Progress Report on Parallelism in MuPAD (1997) (3)A proof of GMP square root using the Coq assistant (2002) (3)A Review of the ODE Solvers of Axiom (1996) (3)Tuning and Generalizing Van Hoeij's Algorithm (2001) (3)How Fast Can We Multiply Over GF(2)[x]? (2007) (3)GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications) (1999) (3)A Fast Algorithm for Testing Irreducibility of Trinomials mod 2 (preliminary report) 1 (2000) (3)Wester's test suite in MuPAD 1.2.2 (1995) (3)Accurate Summation: Towards a Simpler and Formal Proof (2003) (3)Numerical approximation of The Masser-Gramain constant to four decimal digits: δ = 1.819 (2012) Aliquot Sequence 3630 Ends After Reaching 100 Digits (2002) Solving Ordinary Differential Equations (1998) (3)The World of Generating Functions and Umbral Calculus (1995) (2)Implementation of the reciprocal square root in MPFR (2008) (2)Short Division of Long Integers (2011) Three Ways to Test Irreducibility (2008) (2)Elliptic Curve Method (2005) The State of the Art in Integer Factoring and Breaking Public-Key Cryptography (2022) Some notes for a proposal for elementary function implementation in floating-point arithmetic (2001) (2)The CORE-MATH Project (2022) Parallel Structured Gaussian Elimination for the Number Field Sieve (2019) (2)A new ranking function for polynomial selection in the number field sieve (2020) Three Cousins of Recamán's Sequence (2020) (1)Division-Free Binary-to-Decimal Conversion (2014) Solving Problems through Algebraic Computation and Efficient Software (2005) (1)Elliptic Curve Method for Factoring (2011) Accuracy of Mathematical Functions in Single, Double, and Quadruple Precision (2020) (1)FFT extension for algebraic-group factorization algorithms (2017) Size Optimization of Sextic Polynomials in the Number Field Sieve (2012) (1)Interval operations in rounding to nearest (2007) (1)Algorithms seminar, 1991-1992 (1992) (1)Gröbner bases in MuPAD: state and future (1995) (1)Graphical hotspot definition : A common ATA/AECMA approach (1999) (1)Multiplication rapide en Le_Lisp (1987) (1)A Formal Proof of Demmel and Hida's Accurate Summation Algorithm (2004) (1)Twelve new primitive binary trinomials (2016) (1)Introduction to Automatic Analysis (2012) (0)Le « dilemme du fabricant de tables » ou comment calculer juste (2004) (0)New Results - Integer and Polynomial Arithmetic (2005) (0)Modern Computer Arithmetic: Preface (2010) Discrete logarithm in GF(2) with FFS (2015) (0)Symbolic Computation: Recent Progress and New Frontiers (2002) (0)Time -an dSpace-Efficien tEvaluatio no fSome Hypergeometric Constants (2007) (0)Function composition and automatic average case analysis (1995) Modern Computer Arithmetic: Implementations and pointers (2010) Floating-point arithmetic (2010) Anu-inria Associate Team Proposal (2007) (0)New Results - Polynomial Arithmetic (2003) (0)Software - GNU MPFR (2011) (0)Paul Zimmermann - CADO-NFS (2016) (0)Some arguments concerning correct rounding of the elementary functions (2006) (0)D-12-28 A lossy compression method for textures obtained from several views of a 3D object (1999) (0)Contracts and Grants with Industry - MuPAD-Scilab Interface (2003) (0)Hand tool with a cooler and dust extraction (2003) (0)MAGIC SQUARES OF SQUARES (2015) (0)The application/pgp MIME Content-type (1994) (0)Apparatus for winding a film web, esp. A plastic film (1986) (0)Contracts and Grants with Industry - Interface MuPAD-Scilab (2002) (0)Modern Computer Arithmetic: Modular arithmetic and the FFT (2010) New Results - Floating-Point Arithmetic (2003) (0)Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401] (2015) Accuracy of Mathematical Functions in Single, Double, Double Extended, and Quadruple Precision (2021) (0)Survey about the MuPAD functions (1996) Software and Platforms - GNU MPFR (2013) (0)New Results - National Initiatives (2010) (0)Modern Computer Arithmetic: Integer arithmetic (2010) New Results - Arithmétique (2002) (0)Modern Computer Arithmetic: References (2010) Wester's test suite in MuPAD 1.3 (1996) (0)Séries génératrices et analyse automatique d'algorithmes. (Generating functions and automatic analysis of algorithms) (1991) (0)Unranking of unlabelled decomposable structures (1999) (0)Software - CADO-NFS (2011) (0)New Results - Polynômes univariés (2002) (0)The Language and its Functionality (1996) Speeding up the inversion of power series (2000) (0)EÆ ient Algorithms on Numbers , Polynomials , and Series (2000) (0)Modern Computer Arithmetic: Elementary and special function evaluation (2010) Academic Exercises 5-25-90 Speech & Degrees (1990) (0)Software - GMP-ECM (2010) (0)Other Grants and Activities - Actions nationales (2002) (0)Discrete logarithm in GF ( 2 809 ) with FFS The CARAMEL group (2013) (0)Software - MPFR/MPFI (2002) (0)More Papers This paper list is powered by the following services:
Other Resources About Paul Zimmermann What Schools Are Affiliated With Paul Zimmermann ? Paul Zimmermann is affiliated with the following schools:
