Improved results on the Mertens conjecture - Yannick Saouter; Herman te Riele (Math. Comput., 2014)

Aliquot Cycles of Repdigits - Florian Luca; Herman te Riele (Integers, 2011)

Average prime-pair counting formula - Jaap Korevaar; Herman te Riele (Math. Comput., 2010)

Factorization of a 768-Bit RSA Modulus - 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; et al. (Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, 2010)

Factorizations of Cunningham numbers with bases 13 to 99 - Richard P. Brent; Peter L. Montgomery; Herman J. J. te Riele (CoRR, 2010)

Factorization of a 768-bit RSA modulus - 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; et al. (IACR Cryptol. ePrint Arch., 2010)

The Mertens Conjecture Revisited - Tadej Kotnik; Herman te Riele (Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, 2006)

The hexagonal versus the square lattice - Pieter Moree; Herman J. J. te Riele (Math. Comput., 2004)

New Computations Concerning the Cohen-Lenstra Heuristics - Herman te Riele; Hugh C. Williams (Exp. Math., 2003)

Corrigenda and addition to "Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000" - Alfred J. van der Poorten; Herman J. J. te Riele; Hugh C. Williams (Math. Comput., 2003)

Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000 - Alfred J. van der Poorten; Herman J. J. te Riele; Hugh C. Williams (Math. Comput., 2001)

Factorization of a 512-Bit RSA Modulus - Stefania Cavallar; Bruce Dodson; Arjen K. Lenstra; Walter M. Lioen; Peter L. Montgomery; Brian Murphy; Herman J. J. te Riele; Karen I. Aardal; Jeff Gilchrist; Gérard Guillerm; Paul C. Leyland; Joël Marchand; et al. (Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000, Proceeding, 2000)

Factorization of RSA-140 Using the Number Field Sieve - 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 (Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings, 1999)

On phi-amicable pairs - Graeme L. Cohen; Herman J. J. te Riele (Math. Comput., 1998)

New Experimental Results Concerning the Goldbach Conjecture - Jean-Marc Deshouillers; Herman te Riele; Yannick Saouter (Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, 1998)

Errata to Iterating the Sum-of-Divisors Function - Graeme L. Cohen; Herman J. J. te Riele (Exp. Math., 1997)

Iterating the Sum-of-Divisors Function - Graeme L. Cohen; Herman J. J. te Riele (Exp. Math., 1996)

Factoring Integers with Large-Prime Variations of the Quadratic Sieve - Henk Boender; Herman J. J. te Riele (Exp. Math., 1996)

A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers - Richard P. Brent; Alfred J. van der Poorten; Herman J. J. te Riele (Algorithmic Number Theory, Second International Symposium, ANTS-II, Talence, France, May 18-23, 1996, Proceedings, 1996)

Parallel Arnoldi Method for the Construction of a Krylov Subspace Basis: an Application in Magnetohydrodynamics - J. G. L. Booten; P. M. Meijer; Herman te Riele; Henk A. van der Vorst (High-Performance Computing and Networking, International Conference and Exhibition, HPCN Europe 1994, Munich, Germany, April 18-20, 1994, Proceedings, Volume II: Networking and Tools, 1994)