Keywords

Co-authors

Researcher identifiers

  • IdHAL : paul-zimmermann
Number of documents

135

Paul Zimmermann


Paul Zimmermann


Journal articles37 documents

  • David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, et al.. Imperfect forward secrecy: How Diffie-Hellman fails in practice. Communications of the ACM, ACM, 2018, 62 (1), pp.106-114. ⟨10.1145/3292035⟩. ⟨hal-01982426⟩
  • Cyril Bouvier, Paul Zimmermann. Division-Free Binary-to-Decimal Conversion. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩. ⟨hal-00864293v2⟩
  • Guillaume Melquiond, W. Georg Nowak, Paul Zimmermann. Numerical Approximation of the Masser-Gramain Constant to Four Decimal Digits: delta=1.819.... Mathematics of Computation, American Mathematical Society, 2013, 82, pp.1235-1246. ⟨10.1090/S0025-5718-2012-02635-4⟩. ⟨hal-00644166⟩
  • Thomas Prest, Paul Zimmermann. Non-Linear Polynomial Selection for the Number Field Sieve. Journal of Symbolic Computation, Elsevier, 2012, 47 (4), pp.401-409. ⟨inria-00540483⟩
  • Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. RSA : la fin des clés de 768 bits. Techniques de l'Ingenieur, Techniques de l'ingénieur, 2011, ⟨http://www.techniques-ingenieur.fr/base-documentaire/technologies-de-l-information-th9/innovations-en-reseaux-et-telecommunications-42462210/rsa-la-fin-des-cles-de-768-bits-in131/⟩. ⟨hal-00641592⟩
  • Richard Brent, Paul Zimmermann. The Great Trinomial Hunt. Notices of the AMS, American Mathematical Society, 2011, 58 (2), pp.233-239. ⟨inria-00443797⟩
  • Kaveh Ghazi, Vincent Lefèvre, Philippe Théveny, Paul Zimmermann. Why and How to Use Arbitrary Precision. Computing in Science and Engineering, Institute of Electrical and Electronics Engineers, 2010, 12 (3), pp.62-65. ⟨10.1109/MCSE.2010.73⟩. ⟨inria-00543927⟩
  • Siegfried Rump, Paul Zimmermann, Sylvie Boldo, Guillaume Melquiond. Computing predecessor and successor in rounding to nearest. BIT Numerical Mathematics, Springer Verlag, 2009, 49 (2), pp.419-431. ⟨10.1007/s10543-009-0218-z⟩. ⟨inria-00337537⟩
  • Richard Brent, Paul Zimmermann. Ten new primitive binary trinomials. Mathematics of Computation / Mathematics of Computation, American Mathematical Society, 2009, 78 (266), pp.1197-1199. ⟨http://www.ams.org/mcom/2009-78-266/S0025-5718-08-02170-4/home.html⟩. ⟨inria-00337525⟩
  • Marc Deléglise, Jean-Louis Nicolas, Paul Zimmermann. Landau's function for one million billions. Journal de Théorie des Nombres de Bordeaux, Société Arithmétique de Bordeaux, 2008, 20 (3), pp.625-671. ⟨hal-00264057⟩
  • Richard Brent, Paul Zimmermann. A Multi-level Blocking Distinct Degree Factorization Algorithm. Contemporary mathematics, American Mathematical Society, 2008, Finite Fields and Applications, 461, pp.47-58. ⟨inria-00181029v2⟩
  • Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann. MPFR: A Multiple-Precision Binary Floating-Point Library with Correct Rounding.. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2007, 33 (2), pp.article 13. ⟨10.1145/1236463.1236468⟩. ⟨inria-00103655⟩
  • Richard Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point Multiplication. Mathematics of Computation, American Mathematical Society, 2007, 76, pp.1469-1481. ⟨inria-00120352v2⟩
  • Richard Brent, Colin Percival, Paul Zimmermann. Errors Bounds on Complex Floating-Point Multiplication. Mathematics of Computation, American Mathematical Society, 2006. ⟨inria-00107268⟩
  • Damien Stehlé, Paul Zimmermann, Vincent Lefèvre. Searching Worst Cases of a One-Variable Function Using Lattice Reduction. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2005, 54 (3), pp.340-346. ⟨10.1109/TC.2005.55⟩. ⟨inria-00000379⟩
  • Yan Gerard, Isabelle Debled-Rennesson, Paul Zimmermann. An elementary digital plane recognition algorithm. Discrete Applied Mathematics, Elsevier, 2005, 151 (1-3), pp.169-183. ⟨inria-00000621⟩
  • Richard P. Brent, Samuli Larvala, Paul Zimmermann. A Primitive Trinomial of Degree 6972593. Mathematics of Computation, American Mathematical Society, 2005, 74 (250), pp.1001--1002. ⟨hal-00917727⟩
  • David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, et al.. Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numerical Algorithms, Springer Verlag, 2004, 37 (1-4), pp.367-375. ⟨inria-00099967⟩
  • Guillaume Hanrot, Michel Quercia, Paul Zimmermann. The Middle Product Algorithm I. Speeding up the division and square root of power series. Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2004, 14 (6), pp.415-438. ⟨inria-00100147⟩
  • Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann. An elementary digital plane recognition algorithm. Discrete Applied Mathematics, Elsevier, 2004, 17 p. ⟨inria-00100057⟩
  • Fabrice Rouillier, Paul Zimmermann. Efficient isolation of polynomial's real roots. Journal of Computational and Applied Mathematics, Elsevier, 2004, 162 (1), pp.33-50. ⟨10.1016/j.cam.2003.08.015⟩. ⟨inria-00099941⟩
  • Guillaume Hanrot, Paul Zimmermann. A long note on Mulders' short product. Journal of Symbolic Computation, Elsevier, 2004, 37 (3), pp.391--401. ⟨inria-00100069⟩
  • Paul Zimmermann. 10^2098959. Gazette du CINES, CINES, 2003. ⟨hal-00917754⟩
  • Guillaume Hanrot, Joel Rivat, Gérald Tenenbaum, Paul Zimmermann. Density results on floating-point invertible numbers. Theoretical Computer Science, Elsevier, 2003, 291 (2), pp.135-141. ⟨inria-00099510⟩
  • 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. Mathematics of Computation, American Mathematical Society, 2003, 72 (243), pp.1443-1452. ⟨inria-00099744⟩
  • Manuel Benito, Wolfgang Creyaufmueller, Juan Luis Varona, Paul Zimmermann. Aliquot Sequence 3630 Ends After Reaching 100 Digits. Experimental Mathematics, Taylor & Francis, 2002, 11 (2), pp.201-206. ⟨inria-00101005⟩
  • Yves Bertot, Nicolas Magaud, Paul Zimmermann. A Proof of GMP Square Root. Journal of Automated Reasoning, Springer Verlag, 2002, 29 (3-4), pp.225--252. ⟨10.1023/A:1021987403425⟩. ⟨inria-00101044⟩
  • Harvey Dubner, Tony Forbes, Nik Lygeros, Michel Mizony, Harry Nelson, et al.. Ten Consecutive Primes In Arithmetic Progression. Mathematics of Computation, American Mathematical Society, 2002, 71 (239), pp.1323-1328. ⟨inria-00100978⟩
  • Paul Zimmermann. Arithmétique en précision arbitraire. Réseaux et systèmes répartis, calculateurs Parallèles, 2001, 13 (4-5), 29 p. ⟨inria-00100543⟩
  • Alain Denise, Paul Zimmermann. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. Theoretical Computer Science, Elsevier, 1999, 218 (2), pp.233-248. ⟨inria-00098797⟩
  • François Bertault, Olivier Ramaré, Paul Zimmermann. On Sums of Seven Cubes. Mathematics of Computation, American Mathematical Society, 1999, 68 (227), pp.1303-1310. ⟨inria-00108056⟩
  • Alain Denise, Isabelle Dutour, Paul Zimmermann. CS: a MuPAD package for counting and randomly generating combinatorial structures. MathPAD, Paderborn University, 1998, 8, pp.23-30. ⟨hal-00306639⟩
  • Paul Zimmermann. Calcul formel : l'embarras du choix. Gazette des Mathématiciens, Société Mathématique de France, 1997, 73, pp.39--43. ⟨hal-00917751⟩
  • Paul Zimmermann. Wester's test suite in MuPAD 1.3. SAC Newsletter, SAC, 1996. ⟨hal-00917750⟩
  • Paul Zimmermann. Wester's test suite in MuPAD 1.2.2. Computer Algebra Nederland Nieuwsbrief, Computer Algebra Nederland, 1995, pp.53--64. ⟨hal-00917746⟩
  • Paul Zimmermann. Gaïa: a package for the random generation of combinatorial structures. MapleTech, Waterloo Maple Software, 1994, 1 (1), pp.38-46. ⟨hal-00917745⟩
  • Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem. A Calculus for the Random Generation of Labelled Combinatorial Structures. Theoretical Computer Science, Elsevier, 1994, 132 (1-2), pp.1-35. ⟨10.1016/0304-3975(94)90226-7⟩. ⟨hal-00917729⟩

Conference papers37 documents

  • Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann. On various ways to split a floating-point number. ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. pp.53-60, ⟨10.1109/ARITH.2018.8464793⟩. ⟨hal-01774587v2⟩
  • Vincent Lefèvre, Paul Zimmermann. Optimized Binary64 and Binary128 Arithmetic with GNU MPFR. 24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom. pp.18-26, ⟨10.1109/ARITH.2017.28⟩. ⟨hal-01502326⟩
  • David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, et al.. Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. ACM CCS 2015, Oct 2015, Denver, Colorado, United States. pp.5-17, ⟨10.1145/2810103.2813707⟩. ⟨hal-01184171v2⟩
  • Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF($2^{809}$) with FFS. PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩. ⟨hal-00818124v3⟩
  • Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann. Finding Optimal Formulae for Bilinear Maps. Ferruh Özbudak and Francisco Rodríguez-Henríquez. International Workshop of the Arithmetics of Finite Fields, Jul 2012, Bochum, Germany. 7369, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-31662-3_12〉. 〈hal-00640165v2〉
  • David Harvey, Paul Zimmermann. Short Division of Long Integers. 20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩. ⟨inria-00612232⟩
  • Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, et al.. Ballot stuffing in a postal voting system. Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, 2011, Trento, Italy. pp.27 - 36, ⟨10.1109/REVOTE.2011.6045913⟩. ⟨inria-00612418⟩
  • Paul Zimmermann. Reliable Computing with GNU MPFR. Proceedings of the third International Congress on Mathematical Software (ICMS 2010), Sep 2010, Kobe, Japan. pp.42--45, ⟨10.1007/978-3-642-15582-6_8⟩. ⟨hal-00917758⟩
  • Richard Brent, Paul Zimmermann. An O(M(n) log n) algorithm for the Jacobi symbol. 9th Algorithmic Number Theory Symposium - ANTS IX, Jul 2010, Nancy, France. pp.83-95, ⟨10.1007/978-3-642-14518-6_10⟩. ⟨inria-00447968⟩
  • Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen Lenstra, Emmanuel Thomé, et al.. Factorization of a 768-bit RSA modulus. CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩. ⟨inria-00444693v2⟩
  • Richard Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]. ANTS-VIII, May 2008, Banff, Canada. pp.153-166, ⟨10.1007/978-3-540-79456-1⟩. ⟨inria-00188261v4⟩
  • Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann. Worst Cases of a Periodic Function for Large Arguments. 18th IEEE Symposium in Computer Arithmetic, Jun 2007, Montpellier, France. pp.133-140, ⟨10.1109/ARITH.2007.37⟩. ⟨inria-00126474v2⟩
  • Paul Zimmermann. Arithmétique entière. Journées Nationales de Calcul Formel, 2007, Luminy, France. ⟨hal-00917756⟩
  • Paul Zimmermann. How Fast Can We Multiply Over GF(2)[x]?. Proceedings of Conference on Algorithmic Number Theory 2007, 2007, Turku, Finland. pp.165-170. ⟨hal-00917757⟩
  • Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann. A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm. ISSAC 2007, Jul 2007, Waterloo, Ontario, Canada. pp.167-174, ⟨10.1145/1277548.1277572⟩. ⟨inria-00126462v2⟩
  • Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima, Paul Zimmermann. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. International Symposium on Symbolic and Algebraic Computation - ISSAC'07, Association for Computing Machinery, Jul 2007, Waterloo, Canada. pp.85-91, ⟨10.1145/1277548.1277561⟩. ⟨inria-00177850⟩
  • Richard Brent, Paul Zimmermann. A Multi-level Blocking Distinct Degree Factorization Algorithm. 8th International Conference on Finite Fields and Applications (Fq8), Jul 2007, Melbourne, Australia. ⟨inria-00187614⟩
  • Paul Zimmermann, Bruce Dodson. 20 years of ECM. 7th Algorithmic Number Theory Symposium (ANTS VII), 2006, Berlin/Germany, Germany. pp.525--542. ⟨inria-00070192v2⟩
  • Paul Zimmermann. Can we trust floating-point numbers?. ''Grand Challenges of Informatics'', An Academia Europaea Charles Simonyi John von Neumann Computer Society International Symposium, 2006, Budapest, Hungary. ⟨hal-00917755⟩
  • Damien Stehlé, Paul Zimmermann. Gal's Accurate Tables Method Revisited. 17th IEEE Symposium on Computer Arithmetic - ARITH'17, 2005, Cape Cod/USA, pp.236-257, ⟨10.1109/ARITH.2005.24⟩. ⟨inria-00000378⟩
  • Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm. 6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425. ⟨inria-00100175⟩
  • Laurent Fousse, Paul Zimmermann. Accurate Summation: Towards a Simpler and Formal Proof. 5th Conference on Real Numbers and Computers 2003 - RNC5, 2003, Lyon, France, 11 p. ⟨inria-00099686⟩
  • Damien Stehlé, Vincent Lefèvre, Paul Zimmermann. Worst Cases and Lattice Reduction. 16th IEEE Symposium on Computer Arithmetic 2003 - ARITH-16'03, 2003, Santiago de Compostela, Espagne, pp.142-147. ⟨inria-00099572⟩
  • Richard Brent, Paul Zimmermann. Random number generators with period divisible by a Mersenne prime. International Conference on Computational Science and its Applications - ICCSA'2003, 2003, Montreal, Canada, pp.1-10. ⟨inria-00099723⟩
  • Richard Brent, Paul Zimmermann. Algorithms for finding almost irreducible and almost primitive trinomials. Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, 2003, Banff, Canada. ⟨inria-00099724⟩
  • Paul Zimmermann. Symbolic Computation: Recent Progress and New Frontiers. International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none. ⟨inria-00107625⟩
  • John Abbott, Victor Shoup, Paul Zimmermann. Factorization in Z[x]: the searching phase. International Symposium on Symbolic and Algebraic Computation - ISSAC 2000, Aug 2000, St Andrews/United Kingdom, pp.1--7. ⟨inria-00099116⟩
  • Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, et al.. Factorization of a 512-bit RSA Modulus. International Conference on the Theory and Application of Cryptographic Techniques - EUROCRYPT 2000, May 2000, Bruges, Belgium. pp.1-18, ⟨10.1007/3-540-45539-6_1⟩. ⟨inria-00099117⟩
  • Paul Zimmermann. 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). Foundations of Computational Mathematics, 1999, Oxford, United Kingdom. ⟨hal-00917753⟩
  • François Bertault, Paul Zimmermann. Unranking of unlabelled decomposable structures. Troisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, 1999, Montpellier/France, pp.12. ⟨inria-00098835⟩
  • Stefania Cavallar, Bruce Dodson, Arjen-K. Lenstra, Paul Leyland, Walter M. Lioen, et al.. Factorization of RSA-140 using the Number Field Sieve. International Conference on the Theory and Applications of Cryptology and Information Security - ASIACRYPT'99, Nov 1999, Singapore, Singapore. pp.195-207, ⟨10.1007/b72231⟩. ⟨inria-00108061⟩
  • Alain Denise, Isabelle Dutour, Paul Zimmermann. CS: a MuPAD Package for Counting and Randomly Generating Combinatorial Structures. 10-th conference Formal Power Series and Algebraic Combinatorics, 1998, Toronto, pp.195-204. ⟨inria-00107518⟩
  • Nik Lygeros, Michel Mizony, Paul Zimmermann. Sur la division euclidienne d'un nombre premier par son rang. Journée de Mathématiques Effectives en l'honneur des 65 ans de René Ouzilou. Pré-Publication numéro 7 du Département de Mathématiques de l'Université Jean Monnet, 1998, Unknown. ⟨hal-00917737⟩
  • Frank Postel, Paul Zimmermann. A review of the ODE solvers of Axiom, Derive, Maple, Mathematica, Macsyma, MuPAD and Reduce. Proceedings of the 5th RHINE workshop on computer algebra, 1996, Saint-Louis, France. pp.2.1--2.10. ⟨hal-00917739⟩
  • Klaus Drescher, Paul Zimmermann. Gröbner bases in MuPAD: state and future. Proceedings of the PoSSo workshop on software, Paris, 1995, Unknown, pp.177--182. ⟨hal-00917728⟩
  • Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem. A Calculus of Random Generation. Proceedings of the First European Symposium on Algorithms (ESA'93), 1993, Bad Honnef, Germany. pp.169-180, ⟨10.1007/3-540-57273-2_53⟩. ⟨hal-00917730⟩
  • Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann. Average Case Analysis of Unification Algorithms. Proceedings of STACS'91 - 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany. pp.196-213, ⟨10.1007/BFb0020799⟩. ⟨hal-00917726⟩

Documents associated with scientific events1 document

  • Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann. Finding Optimal Formulae for Bilinear Maps. AriC Seminar, Mar 2012, Lyon, France. ⟨hal-01413162⟩

Books5 documents

  • Paul Zimmermann, Alexandre Casamayou, Nathann Cohen, Guillaume Connan, Thierry Dumont, et al.. Computational Mathematics with SageMath. SIAM, 2018, 978-1-61197-545-1. ⟨10.1137/1.9781611975468⟩. ⟨hal-01646401⟩
  • Richard Brent, Paul Zimmermann. Modern Computer Arithmetic. Cambridge University Press, 18, 221 p., 2010, Cambridge Monographs on Applied and Computational Mathematics, 978-0-521-19469-3. ⟨inria-00424347⟩
  • Philippe Dumas, Claude Gomez, Bruno Salvy, Paul Zimmermann. Calcul formel : mode d'emploi. Exemples en Maple. Sans, pp.326, 2009. ⟨inria-00371192⟩
  • Benno Fuchssteiner, Klaus Drescher, Andreas Kemper, Oliver Kluge, Karsten Morisse, et al.. MuPAD User's Manual. Wiley Ltd., pp.572, 1996. ⟨hal-00917734⟩
  • Claude Gomez, Bruno Salvy, Paul Zimmermann. Calcul formel : mode d'emploi. Exemples en Maple. Masson, 13, pp.328, 1995, Logique mathématiques informatique, 2-225-84780-0. ⟨hal-00917735⟩

Book sections7 documents

  • Richard Brent, Alexander Kruppa, Paul Zimmermann. FFT extension for algebraic-group factorization algorithms. Joppe W. Bos; Arjen K. Lenstra. Topics in Computational Number Theory Inspired by Peter L. Montgomery, Cambridge University Press, pp.189-205, 2017, 978-1-107-10935-3. ⟨hal-01630907⟩
  • Vincent Lefèvre, Damien Stehlé, Paul Zimmermann. Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. P. Hertling; C.M. Hoffmann; W. Luther; N. Revol. Reliable Implementation of Real Number Algorithms: Theory and Practice, 5045, Springer, pp.114-126, 2008, Lecture Notes in Computer Science, 978-3-540-85521-7. ⟨10.1007/978-3-540-85521-7_7⟩. ⟨http://www.dagstuhl.de/06021⟩. ⟨inria-00068731v2⟩
  • Paul Zimmermann. The Elliptic Curve Method. van Tilborg, Henk C.A. Encyclopedia of Cryptography and Security, Springer, 2005. ⟨inria-00000630⟩
  • Paul Zimmermann. Techniques algorithmiques et méthodes de programmation. Jean-Eric Pin. Encyclopédie de l'informatique et des systèmes d'information, Vuibert, 2005. ⟨inria-00000664⟩
  • Paul Zimmermann. The Elliptic Curve Method. none. Encyclopedia of Information Security, Kluwer, 2002. ⟨inria-00100980⟩
  • Frank Postel, Paul Zimmermann. Solving Ordinary Differential Equations. Michael Wester. Computer Algebra Systems: A Practical Guide, John Wiley & Sons Ltd, 1999. ⟨inria-00098850⟩
  • Paul Zimmermann. Calcul formel : ce qu'il y a dans la boîte. Nicole Berline and Claude Sabbah. Journées X-UPS 97, École Polytechnique, pp.47--62, 1997. ⟨hal-00917752⟩

Directions of work or proceedings2 documents

  • Guillaume Hanrot, Paul Zimmermann. Proceedings of the 7th Conference on Real Numbers and Computers (RNC'7). Guillaume Hanrot, Paul Zimmermann. None., 151 p., 2006, 2-905267-50-X. ⟨inria-00107213⟩
  • Norbert Müller, Martin Escardo, Paul Zimmermann. Special issue on practical development of exact real number computation. Norbert Müller and Martin Escardo and Paul Zimmermann. Elsevier, pp.154, 2005. ⟨hal-00917738⟩

Other publications1 document

  • Paul Zimmermann, Laurent Bernardin, Michael Monagan. Polynomial Factorization Challenges. 1996. ⟨hal-00917742⟩

Preprints, Working Papers, ...6 documents

  • Charles Bouillaguet, Paul Zimmermann. Parallel Structured Gaussian Elimination for the Number Field Sieve. 2019. ⟨hal-02098114⟩
  • Shi Bai, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-220 with CADO-NFS. 2016. ⟨hal-01315738⟩
  • Richard Brent, Paul Zimmermann. Twelve new primitive binary trinomials. 2016. ⟨hal-01378493⟩
  • Shi Bai, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-704 with CADO-NFS. 2012. ⟨hal-00760322⟩
  • Shi Bai, Paul Zimmermann. Size Optimization of Sextic Polynomials in the Number Field Sieve. 2012. ⟨hal-00760331⟩
  • Jean-Michel Muller, Paul Zimmermann. Some arguments concerning correct rounding of the elementary functions. 2006. ⟨ensl-00086516⟩

Reports35 documents

  • Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima, Paul Zimmermann. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. [Research Report] RR-6105, INRIA. 2007. ⟨inria-00126428v2⟩
  • Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann. MPFR: A Multiple-Precision Binary Floating-Point Library With Correct Rounding. [Research Report] RR-5753, INRIA. 2005, pp.15. ⟨inria-00070266⟩
  • Damien Stehlé, Paul Zimmermann. Gal's Accurate Tables Method Revisited. [Research Report] RR-5359, INRIA. 2004, pp.23. ⟨inria-00070644⟩
  • David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, et al.. Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. [Research Report] RR-5406, INRIA. 2004. ⟨inria-00071249⟩
  • Vincent Lefèvre, Paul Zimmermann. Arithmétique flottante. [Rapport de recherche] RR-5105, INRIA. 2004. ⟨inria-00071477⟩
  • Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann. A fast and elementary algorithm for digital plane recognition. [Intern report] A03-R-332 || gerard03a, 2003, 16 p. ⟨inria-00099772⟩
  • Yves Bertot, Nicolas Magaud, Paul Zimmermann. A proof of GMP square root using the Coq assistant. [Research Report] RR-4475, INRIA. 2002. ⟨inria-00072113⟩
  • Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm. [Research Report] RR-5050, INRIA. 2002. ⟨inria-00071533⟩
  • Damien Stehlé, Vincent Lefèvre, Paul Zimmermann. Worst Cases and Lattice Reduction. [Research Report] RR-4586, INRIA. 2002. ⟨inria-00071999⟩
  • Guillaume Hanrot, Paul Zimmermann. A long note on Mulders' short product. [Research Report] RR-4654, INRIA. 2002. ⟨inria-00071931⟩
  • Guillaume Hanrot, Michel Quercia, Paul Zimmermann. The Middle Product Algorithm, I.. [Research Report] RR-4664, INRIA. 2002. ⟨inria-00071921⟩
  • Fabrice Rouillier, Paul Zimmermann. Efficient Isolation of a Polynomial Real Roots. [Research Report] RR-4113, INRIA. 2001. ⟨inria-00072518⟩
  • Karim Belabas, Guillaume Hanrot, Paul Zimmermann. Tuning and Generalizing Van Hoeij's Algorithm. [Research Report] RR-4124, INRIA. 2001. ⟨inria-00072504⟩
  • Paul Zimmermann. Arithmétique en précision arbitraire. [Rapport de recherche] RR-4272, INRIA. 2001. ⟨inria-00072315⟩
  • Guillaume Hanrot, Michel Quercia, Paul Zimmermann. Speeding up the Division and Square Root of Power Series. [Research Report] RR-3973, INRIA. 2000, pp.20. ⟨inria-00072675⟩
  • Guillaume Hanrot, Paul Zimmermann. Speeding up the inversion of power series. [Intern report] A00-R-067 || hanrot00a, 2000, 8 p. ⟨inria-00099294⟩
  • Paul Zimmermann. A proof of GMP fast division and square root implementations. [Intern report] A00-R-211 || zimmermann00a, 2000. ⟨inria-00099334⟩
  • Richard P. Brent, Samuli Larvala, Paul Zimmermann. A Fast Algorithm for Testing Irreducibility of Trinomials mod 2. [Intern report] A00-R-465 || brent00a, 2000, 13 p. ⟨inria-00099332⟩
  • Paul Zimmermann. Karatsuba Square Root. [Research Report] RR-3805, INRIA. 1999, pp.8. ⟨inria-00072854⟩
  • Isabelle Dutour, Laurent Habsieger, Paul Zimmermann. Estimations asymptotiques du nombre de chemins Nord-Est de pente fixée et de largeur bornée. [Rapport de recherche] RR-3585, INRIA. 1998, pp.13. ⟨inria-00073095⟩
  • Paul Zimmermann. Cinq algorithmes de calcul symbolique. [Rapport de recherche] RT-0206, INRIA. 1997, pp.21. ⟨inria-00069965⟩
  • Alain Denise, Paul Zimmermann. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. [Research Report] RR-3242, INRIA. 1997. ⟨inria-00073447⟩
  • Christian Heckler, Torsten Metzner, Paul Zimmermann. Progress Report on Parallelism in MuPAD. [Research Report] RR-3154, INRIA. 1997. ⟨inria-00073535⟩
  • Philippe Flajolet, Paul Zimmermann, B. Van Custem. A Calculus for the random generation of combinatorial structures. [Research Report] RR-1830, INRIA. 1993. ⟨inria-00074842⟩
  • Paul Zimmermann. EPELLE : un logiciel de detection de fautes d'orthographe. [Rapport de recherche] RR-2030, INRIA. 1993. ⟨inria-00074641⟩
  • Bruno Salvy, Paul Zimmermann. GFUN : a maple package for the manipulation of generating and holonomic functions in one variable. [Research Report] RT-0143, INRIA. 1992, pp.14. ⟨inria-00070025⟩
  • Philippe Flajolet, Paul Zimmermann. Algorithms seminar, 1991-1992. [Research Report] RR-1779, INRIA. 1992. ⟨inria-00077019⟩
  • Paul Zimmermann. Analysis of functions with a finite number of return values. [Research Report] RR-1625, INRIA. 1992. ⟨inria-00074936⟩
  • Philippe Flajolet, Paul Zimmermann, Bruno Salvy. Automatic average-case analysis of algorithms. [Research Report] RR-1233, INRIA. 1990. ⟨inria-00077102⟩
  • Luc Albert, Rafaël Casas, Francois Fages, Paul Zimmermann. Average case analysis of unification algorithms. [Research Report] RR-1213, INRIA. 1990. ⟨inria-00075345⟩
  • Paul Zimmermann. ALAS : Un systeme d'analyse algebrique. [Rapport de recherche] RR-0968, INRIA. 1989. ⟨inria-00075591⟩
  • Jean-Claude Herve, François Morain, David Salesin, Bernard Paul Serpette, Jean Vuillemin, et al.. BigNum : un module portable et efficace pour une arithmetique a precision arbitraire. [Rapport de recherche] RR-1016, INRIA. 1989. ⟨inria-00075542⟩
  • Paul Zimmermann, Wolf Zimmermann. The automatic complexity analysis of divide-and-conquer algorithms. [Research Report] RR-1149, INRIA. 1989. ⟨inria-00075410⟩
  • Philippe Flajolet, Paul Zimmermann, Bruno Salvy. Lambda-Upsilon-Omega the 1989 cookbook. [Research Report] RR-1073, INRIA. 1989. ⟨inria-00075486⟩
  • Philippe Flajolet, Paul Zimmermann, Bruno Salvy. Lambda-Upsilon-Omega : an assistant algorithms analyzer. [Research Report] RR-0876, INRIA. 1988. ⟨inria-00075678⟩

Theses1 document

  • Paul Zimmermann. Séries génératrices et analyse automatique d'algorithmes. Informatique [cs]. Ecole Polytechnique X, 1991. Français. ⟨tel-00526670⟩

Habilitation à diriger des recherches1 document

  • Paul Zimmermann. De l'algorithmique à l'arithmétique via le calcul formel. Génie logiciel [cs.SE]. Université Henri Poincaré - Nancy I, 2001. ⟨tel-00526731⟩

Lectures1 document

  • Richard Brent, Paul Zimmermann. Modern Computer Arithmetic. Licence. France. 2010. ⟨cel-01500109⟩

Videos1 document