1. Richard Brent and Paul Zimmermann, A multi-level blocking distinct degree factorization algorithm, Finite Fields and Applications, Contemporary Mathematics, vol. 461, 2008, 47–58 pages.
  2. Richard P. Brent and Paul Zimmermann, Ten new primitive binary trinomials, Math. Comp. 78 (2009), no. 266, 1197–1199.[MR]
  3. H. Dubner, T. Forbes, N. Lygeros, M. Mizony, H. Nelson, and P. Zimmermann, Ten consecutive primes in arithmetic progression, Math. Comp. 71 (2002), no. 239, 1323–1328 (electronic).[MR]
  4. Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, and Paul Zimmermann, MPFR: a multiple-precision binary floating-point library with correct rounding, ACM Trans. Math. Software 33 (2007), no. 2, Art. 13, 15.[MR]
  5. Pierrick Gaudry, Alexander Kruppa, and Paul Zimmermann, A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm, ISSAC 2007, ACM, New York, 2007, pp. 167–174.[MR]
  6. Damien Stehlé and Paul Zimmermann, A binary recursive GCD algorithm, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 411–425.[MR]
  7. Paul Zimmermann and Bruce Dodson, 20 years of ECM, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 525–542.[MR]