| Publication | Date of Publication | Type |
|---|
FFT Extension for Algebraic-Group Factorization Algorithms
Topics in Computational Number Theory Inspired by Peter L. Montgomery | 2023-04-21 | Paper |
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
| 2022-11-09 | Paper |
Three cousins of Recamán's sequence
| 2022-09-21 | Paper |
Is normal backwardation normal? Valuing financial futures with a local index-rate covariance
European Journal of Operational Research | 2022-02-22 | Paper |
The role of the leverage effect in the price discovery process of credit markets
Journal of Economic Dynamics and Control | 2021-11-16 | Paper |
A new ranking function for polynomial selection in the number field sieve
75 Years of Mathematics of Computation | 2021-07-09 | Paper |
Computational mathematics with SageMath. Translated from the 2013 French original by the authors
| 2019-04-09 | Paper |
Division-Free Binary-to-Decimal Conversion
IEEE Transactions on Computers | 2017-06-20 | Paper |
Twelve new primitive binary trinomials
| 2016-05-23 | Paper |
Better polynomials for GNFS
Mathematics of Computation | 2016-03-09 | Paper |
Factorization in Z[x]
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Corrigendum to ``A long note on Mulders' short product
Journal of Symbolic Computation | 2014-07-16 | Paper |
Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Numerical approximation of the Masser-Gramain constant to four decimal digits: \(\delta= 1.819\dots\)
Mathematics of Computation | 2013-03-20 | Paper |
Finding optimal formulae for bilinear maps
Arithmetic of Finite Fields | 2012-11-01 | Paper |
Non-linear polynomial selection for the number field sieve
Journal of Symbolic Computation | 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
Mathematics of Computation | 2010-11-07 | Paper |
An O(M(n) logn) Algorithm for the Jacobi Symbol
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Reliable Computing with GNU MPFR
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
Factorization of a 768-Bit RSA Modulus
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Computing predecessor and successor in rounding to nearest
BIT | 2009-07-24 | Paper |
scientific article; zbMATH DE number 5575550 (Why is no real title available?)
| 2009-07-06 | Paper |
Landau's function for one million billions
Journal de Théorie des Nombres de Bordeaux | 2009-06-30 | Paper |
A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
| 2009-01-20 | Paper |
Time- and space-efficient evaluation of some hypergeometric constants
| 2009-01-20 | Paper |
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
Reliable Implementation of Real Number Algorithms: Theory and Practice | 2009-01-13 | Paper |
MPFR
ACM Transactions on Mathematical Software | 2008-12-21 | Paper |
Faster Multiplication in GF(2)[x]
Lecture Notes in Computer Science | 2008-05-27 | Paper |
A long note on Mulders' short product
Journal of Symbolic Computation | 2007-08-24 | Paper |
Error bounds on complex floating-point multiplication
Mathematics of Computation | 2007-05-02 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Searching worst cases of a one-variable function using lattice reduction
IEEE Transactions on Computers | 2007-01-09 | Paper |
Aliquot Sequence 3630 Ends After Reaching 100 Digits
Experimental Mathematics | 2006-06-14 | Paper |
Proposal for a standardization of mathematical function implementation in floating-point arith\-metic
Numerical Algorithms | 2005-09-05 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
| 2005-04-08 | Paper |
A primitive trinomial of degree 6972593
Mathematics of Computation | 2005-03-01 | Paper |
The middle product algorithm. I: Speeding up the division and square root of power series
Applicable Algebra in Engineering, Communication and Computing | 2004-09-22 | Paper |
Efficient isolation of polynomial's real roots.
Journal of Computational and Applied Mathematics | 2004-01-26 | Paper |
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
Mathematics of Computation | 2003-05-14 | Paper |
A proof of GMP square root
Journal of Automated Reasoning | 2003-04-27 | Paper |
Density results on floating-point invertible numbers.
Theoretical Computer Science | 2003-01-21 | Paper |
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science | 1999-06-21 | Paper |
On sums of seven cubes
Mathematics of Computation | 1999-04-28 | Paper |
GFUN
ACM Transactions on Mathematical Software | 1998-01-25 | Paper |
Function composition and automatic average case analysis
Discrete Mathematics | 1995-07-13 | Paper |
The n-Queens Problem
The American Mathematical Monthly | 1995-03-02 | Paper |
scientific article; zbMATH DE number 176505 (Why is no real title available?)
| 1993-05-18 | Paper |
Automatic average-case analysis of algorithms
Theoretical Computer Science | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4115969 (Why is no real title available?)
| 1989-01-01 | Paper |
