Herman J. J. te Riele

According to our database, Herman J. J. te Riele authored at least 19 papers between 1994 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2014

Improved results on the Mertens conjecture.

Yannick Saouter, Herman te Riele

Math. Comput., 2014

2011

Aliquot Cycles of Repdigits.

Florian Luca, Herman te Riele

Integers, 2011

2010

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, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2010

Factorizations of Cunningham numbers with bases 13 to 99

Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele

CoRR, 2010

2006

The Mertens Conjecture Revisited.

Tadej Kotnik, Herman te Riele

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2004

The hexagonal versus the square lattice.

Pieter Moree, Herman J. J. te Riele

Math. Comput., 2004

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

New Computations Concerning the Cohen-Lenstra Heuristics.

Herman te Riele, Hugh C. Williams

Exp. Math., 2003

2001

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

2000

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, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann

Proceedings of the Advances in Cryptology, 2000

1999

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

Proceedings of the Advances in Cryptology, 1999

1998

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

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Errata to Iterating the Sum-of-Divisors Function.

Graeme L. Cohen, Herman J. J. te Riele

Exp. Math., 1997

1996

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

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1994

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

Proceedings of the High-Performance Computing and Networking, 1994