| Publication | Date of Publication | Type |
|---|
| FFT Extension for Algebraic-Group Factorization Algorithms | 2023-04-21 | Paper |
| Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment | 2022-11-09 | Paper |
| Three Cousins of Recaman's Sequence | 2022-09-21 | Paper |
| Is normal backwardation normal? Valuing financial futures with a local index-rate covariance | 2022-02-22 | Paper |
| The role of the leverage effect in the price discovery process of credit markets | 2021-11-16 | Paper |
| A new ranking function for polynomial selection in the number field sieve | 2021-07-09 | Paper |
| Computational Mathematics with SageMath | 2019-04-09 | Paper |
| Division-Free Binary-to-Decimal Conversion | 2017-06-20 | Paper |
| Twelve new primitive binary trinomials | 2016-05-23 | Paper |
| Better polynomials for GNFS | 2016-03-09 | Paper |
| Factorization in Z[x] | 2015-11-26 | Paper |
| Corrigendum to ``A long note on Mulders' short product | 2014-07-16 | Paper |
| Discrete Logarithm in GF(2809) with FFS | 2014-03-25 | Paper |
| Numerical approximation of The Masser-Gramain constant to four decimal digits: $\delta = 1.819...$ | 2013-03-20 | Paper |
| Finding Optimal Formulae for Bilinear Maps | 2012-11-01 | Paper |
| Non-linear polynomial selection for the number field sieve | 2012-05-04 | Paper |
| Maximal determinants and saturated D-optimal designs of orders 19 and 37 | 2011-12-18 | Paper |
| The great trinomial hunt | 2011-05-31 | Paper |
| Modern Computer Arithmetic | 2010-12-02 | Paper |
| Ten new primitive binary trinomials | 2010-11-07 | Paper |
| An O(M(n) logn) Algorithm for the Jacobi Symbol | 2010-09-29 | Paper |
| Reliable Computing with GNU MPFR | 2010-09-14 | Paper |
| Factorization of a 768-Bit RSA Modulus | 2010-08-24 | Paper |
| Computing predecessor and successor in rounding to nearest | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3635536 | 2009-07-06 | Paper |
| Landau's function for one million billions | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301666 | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301655 | 2009-01-20 | Paper |
| Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format | 2009-01-13 | Paper |
| MPFR | 2008-12-21 | Paper |
| Faster Multiplication in GF(2)[x] | 2008-05-27 | Paper |
| A long note on Mulders' short product | 2007-08-24 | Paper |
| Error bounds on complex floating-point multiplication | 2007-05-02 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| Searching worst cases of a one-variable function using lattice reduction | 2007-01-09 | Paper |
| Aliquot Sequence 3630 Ends After Reaching 100 Digits | 2006-06-14 | Paper |
| Proposal for a standardization of mathematical function implementation in floating-point arith\-metic | 2005-09-05 | Paper |
| Algorithmic Number Theory | 2005-08-12 | Paper |
| Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials | 2005-04-08 | Paper |
| A primitive trinomial of degree 6972593 | 2005-03-01 | Paper |
| The middle product algorithm. I: Speeding up the division and square root of power series | 2004-09-22 | Paper |
| Efficient isolation of polynomial's real roots. | 2004-01-26 | Paper |
| A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 | 2003-05-14 | Paper |
| A proof of GMP square root | 2003-04-27 | Paper |
| Density results on floating-point invertible numbers. | 2003-01-21 | Paper |
| Uniform random generation of decomposable structures using floating-point arithmetic | 1999-06-21 | Paper |
| On sums of seven cubes | 1999-04-28 | Paper |
| GFUN | 1998-01-25 | Paper |
| Function composition and automatic average case analysis | 1995-07-13 | Paper |
| The n-Queens Problem | 1995-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035669 | 1993-05-18 | Paper |
| Automatic average-case analysis of algorithms | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730781 | 1989-01-01 | Paper |
