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 (HPCN, 1994)

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 (ANTS, 1996)

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

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

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

New Experimental Results Concerning the Goldbach Conjecture. - Jean-Marc Deshouillers; Herman te Riele; Yannick Saouter (ANTS, 1998)

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

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 (ASIACRYPT, 1999)

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. (EUROCRYPT, 2000)

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)

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)

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

The Mertens Conjecture Revisited. - Tadej Kotnik; Herman te Riele (ANTS, 2006)

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)

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

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

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