| 2013 | ||
|---|---|---|
| j23 | Guillaume Melquiond, W. Georg Nowak, Paul Zimmermann: Numerical approximation of The Masser-Gramain constant to four decimal digits: δ = 1.819.... Math. Comput. 82(282) (2013) | |
| i9 | Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann: Discrete logarithm in GF(2^809) with FFS. IACR Cryptology ePrint Archive 2013: 197 (2013) | |
| 2012 | ||
| j22 | Thomas Prest, Paul Zimmermann: Non-linear polynomial selection for the number field sieve. J. Symb. Comput. 47(4): 401-409 (2012) | |
| c24 | Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann: Finding Optimal Formulae for Bilinear Maps. WAIFI 2012: 168-186 | |
| i8 | Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann: Finding Optimal Formulae for Bilinear Maps. IACR Cryptology ePrint Archive 2012: 110 (2012) | |
| i7 | Shi Bai, Emmanuel Thomé, Paul Zimmermann: Factorisation of RSA-704 with CADO-NFS. IACR Cryptology ePrint Archive 2012: 369 (2012) | |
| 2011 | ||
| c23 | David Harvey, Paul Zimmermann: Short Division of Long Integers. IEEE Symposium on Computer Arithmetic 2011: 7-14 | |
| c22 | Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann: Ballot stuffing in a postal voting system. REVOTE 2011: 27-36 | |
| r2 | Paul Zimmermann: Elliptic Curve Method for Factoring. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 401-403 | |
| 2010 | ||
| j21 | Kaveh R. Ghazi, Vincent Lefèvre, Philippe Théveny, Paul Zimmermann: Why and How to Use Arbitrary Precision. Computing in Science and Engineering 12(3): 5 (2010) | |
| c21 | Richard P. Brent, Paul Zimmermann: An O(M(n) logn) Algorithm for the Jacobi Symbol. ANTS 2010: 83-95 | |
| c20 | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350 | |
| c19 | ||
| i6 | Richard P. Brent, Paul Zimmermann: An O(M(n) log n) algorithm for the Jacobi symbol. CoRR abs/1004.2091 (2010) | |
| i5 | Richard P. Brent, Paul Zimmermann: Modern Computer Arithmetic (version 0.5.1). CoRR abs/1004.4710 (2010) | |
| i4 | ||
| i3 | Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-bit RSA modulus. IACR Cryptology ePrint Archive 2010: 6 (2010) | |
| 2009 | ||
| j20 | Richard P. Brent, Paul Zimmermann: Ten new primitive binary trinomials. Math. Comput. 78(266): 1197-1199 (2009) | |
| 2008 | ||
| c18 | Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann: Faster Multiplication in GF(2)[x]. ANTS 2008: 153-166 | |
| c17 | Vincent Lefèvre, Damien Stehlé, Paul Zimmermann: Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. Reliable Implementation of Real Number Algorithms 2008: 114-126 | |
| c16 | Paul Zimmermann: Implementation of the reciprocal square root in MPFR. Numerical Validation in Current Hardware Architectures 2008 | |
| 2007 | ||
| j19 | Richard P. Brent, Colin Percival, Paul Zimmermann: Error bounds on complex floating-point multiplication. Math. Comput. 76(259): 1469-1481 (2007) | |
| j18 | Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann: MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2): 13 (2007) | |
| c15 | Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann: Worst Cases of a Periodic Function for Large Arguments. IEEE Symposium on Computer Arithmetic 2007: 133-140 | |
| c14 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima: Time-and space-efficient evaluation of some hypergeometric constants. ISSAC 2007: 85-91 | |
| c13 | Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann: A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. ISSAC 2007: 167-174 | |
| i2 | Richard P. Brent, Paul Zimmermann: A Multi-level Blocking Distinct Degree Factorization Algorithm. CoRR abs/0710.4410 (2007) | |
| i1 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann: Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. CoRR abs/cs/0701151 (2007) | |
| 2006 | ||
| c12 | ||
| c11 | Vincent Lefèvre, Damien Stehlé, Paul Zimmermann: Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. Reliable Implementation of Real Number Algorithms 2006 | |
| 2005 | ||
| j17 | Norbert Th. Müller, Martín Hötzel Escardó, Paul Zimmermann: Guest editors' introduction: Special issue on practical development of exact real number computation. J. Log. Algebr. Program. 64(1): 1-2 (2005) | |
| j16 | Richard P. Brent, Samuli Larvala, Paul Zimmermann: A primitive trinomial of degree 6972593. Math. Comput. 74(250): 1001-1002 (2005) | |
| j15 | Damien Stehlé, Vincent Lefèvre, Paul Zimmermann: Searching Worst Cases of a One-Variable Function Using Lattice Reduction. IEEE Trans. Computers 54(3): 340-346 (2005) | |
| c10 | Damien Stehlé, Paul Zimmermann: Gal's Accurate Tables Method Revisited. IEEE Symposium on Computer Arithmetic 2005: 257-264 | |
| r1 | ||
| 2004 | ||
| j14 | Guillaume Hanrot, Michel Quercia, Paul Zimmermann: The Middle Product Algorithm I. Appl. Algebra Eng. Commun. Comput. 14(6): 415-438 (2004) | |
| j13 | Guillaume Hanrot, Paul Zimmermann: A long note on Mulders' short product. J. Symb. Comput. 37(3): 391-401 (2004) | |
| j12 | David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann: Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numerical Algorithms 37(1-4): 367-375 (2004) | |
| c9 | ||
| 2003 | ||
| j11 | Richard P. Brent, Samuli Larvala, Paul Zimmermann: A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377. Math. Comput. 72(243): 1443-1452 (2003) | |
| j10 | Guillaume Hanrot, Joël Rivat, Gerald Tenenbaum, Paul Zimmermann: Density results on floating-point invertible numbers. Theor. Comput. Sci. 291(2): 135-141 (2003) | |
| c8 | Damien Stehlé, Vincent Lefèvre, Paul Zimmermann: Worst Cases and Lattice Reduction. IEEE Symposium on Computer Arithmetic 2003: 142-147 | |
| c7 | Richard P. Brent, Paul Zimmermann: Random Number Generators with Period Divisible by a Mersenne Prime. ICCSA (1) 2003: 1-10 | |
| 2002 | ||
| j9 | Manuel Benito, Wolfgang Creyaufmüller, Juan L. Varona, Paul Zimmermann: Aliquot Sequence 3630 Ends After Reaching 100 Digits. Experimental Mathematics 11(2): 201-206 (2002) | |
| j8 | Yves Bertot, Nicolas Magaud, Paul Zimmermann: A Proof of GMP Square Root. J. Autom. Reasoning 29(3-4): 225-252 (2002) | |
| j7 | Harvey Dubner, Tony Forbes, Nik Lygeros, Michel Mizony, Harry Nelson, Paul Zimmermann: Ten consecutive primes in arithmetic progression. Math. Comput. 71(239): 1323-1328 (2002) | |
| 2000 | ||
| c6 | Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann: Factorization of a 512-Bit RSA Modulus. EUROCRYPT 2000: 1-18 | |
| c5 | John Abbott, Victor Shoup, Paul Zimmermann: Factorization in ***[x]: the searching phase. ISSAC 2000: 1-7 | |
| 1999 | ||
| j6 | François Bertault, Olivier Ramaré, Paul Zimmermann: On sums of seven cubes. Math. Comput. 68(227): 1303-1310 (1999) | |
| j5 | Alain Denise, Paul Zimmermann: Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. Theor. Comput. Sci. 218(2): 233-248 (1999) | |
| c4 | Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann: Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT 1999: 195-207 | |
| 1995 | ||
| j4 | Paul Zimmermann: Function composition and automatic average case analysis. Discrete Mathematics 139(1-3): 443-453 (1995) | |
| 1994 | ||
| j3 | Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem: A Calculus for the Random Generation of Labelled Combinatorial Structures. Theor. Comput. Sci. 132(2): 1-35 (1994) | |
| j2 | Bruno Salvy, Paul Zimmermann: GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20(2): 163-177 (1994) | |
| 1993 | ||
| c3 | Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem: A Calculus of Random Generation. ESA 1993: 169-180 | |
| 1991 | ||
| j1 | Philippe Flajolet, Bruno Salvy, Paul Zimmermann: Automatic Average-Case Analysis of Algorithm. Theor. Comput. Sci. 79(1): 37-109 (1991) | |
| c2 | Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann: Average Case Analysis of Unification Algorithms. STACS 1991: 196-213 | |
| 1988 | ||
| c1 | Philippe Flajolet, Bruno Salvy, Paul Zimmermann: Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. AAECC 1988: 201-212 | |
Colors in the list of coauthors
Last update Wed May 22 17:15:38 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page