default search action
Herman J. J. te Riele
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j11]Yannick Saouter
, Herman te Riele:
Improved results on the Mertens conjecture. Math. Comput. 83(285): 421-433 (2014) - 2011
- [j10]Florian Luca, Herman te Riele:
Aliquot Cycles of Repdigits. Integers 11: A53 (2011) - 2010
- [j9]Jaap Korevaar, Herman te Riele:
Average prime-pair counting formula. Math. Comput. 79(270): 1209-1229 (2010) - [c7]Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé
Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350 - [i2]Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele:
Factorizations of Cunningham numbers with bases 13 to 99. CoRR abs/1004.3169 (2010) - [i1]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:
Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 2010: 6 (2010)
2000 – 2009
- 2006
- [c6]Tadej Kotnik, Herman te Riele:
The Mertens Conjecture Revisited. ANTS 2006: 156-167 - 2004
- [j8]Pieter Moree, Herman J. J. te Riele:
The hexagonal versus the square lattice. Math. Comput. 73(245): 451-473 (2004) - 2003
- [j7]Herman te Riele, Hugh C. Williams:
New Computations Concerning the Cohen-Lenstra Heuristics. Exp. Math. 12(1): 99-113 (2003) - [j6]Alfred J. van der Poorten, Herman J. J. te Riele, Hugh C. Williams:
Corrigenda and addition to "Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000". Math. Comput. 72(241): 521-523 (2003) - 2001
- [j5]Alfred J. van der Poorten, Herman J. J. te Riele, Hugh C. Williams:
Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000. Math. Comput. 70(235): 1311-1328 (2001) - 2000
- [c5]Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen
Factorization of a 512-Bit RSA Modulus. EUROCRYPT 2000: 1-18
1990 – 1999
- 1999
- [c4]Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen
Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT 1999: 195-207 - 1998
- [j4]Graeme L. Cohen, Herman J. J. te Riele:
On phi-amicable pairs. Math. Comput. 67(221): 399-411 (1998) - [c3]Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter
New Experimental Results Concerning the Goldbach Conjecture. ANTS 1998: 204-215 - 1997
- [j3]Graeme L. Cohen, Herman J. J. te Riele:
Errata to Iterating the Sum-of-Divisors Function. Exp. Math. 6(2): 177 (1997) - 1996
- [j2]Graeme L. Cohen, Herman J. J. te Riele:
Iterating the Sum-of-Divisors Function. Exp. Math. 5(2): 91-100 (1996) - [j1]Henk Boender, Herman J. J. te Riele:
Factoring Integers with Large-Prime Variations of the Quadratic Sieve. Exp. Math. 5(4): 257-273 (1996) - [c2]Richard P. Brent, Alfred J. van der Poorten, Herman J. J. te Riele:
A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers. ANTS 1996: 35-47 - 1994
- [c1]J. G. L. Booten, P. M. Meijer, Herman te Riele, Henk A. van der Vorst:
Parallel Arnoldi Method for the Construction of a Krylov Subspace Basis: an Application in Magnetohydrodynamics. HPCN 1994: 196-201
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: