| Publication | Date of Publication | Type |
|---|
| Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused | 2024-12-13 | Paper |
| Approx-SVP in ideal lattices with pre-processing | 2020-02-06 | Paper |
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
Exponential Sums and Correctly-Rounded Functions
IEEE Transactions on Computers | 2018-06-27 | Paper |
Solvability by radicals from an algorithmic point of view
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Formally verified certificate checkers for hardest-to-round computation
Journal of Automated Reasoning | 2015-07-02 | Paper |
Corrigendum to ``A long note on Mulders' short product
Journal of Symbolic Computation | 2014-07-16 | Paper |
Friable Turan-Kubilius constants: a numerical study
Experimental Mathematics | 2012-08-31 | Paper |
Analyzing blockwise lattice algorithms using dynamical systems
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Algorithms for the shortest and closest lattice vector problems
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Accelerating lattice reduction with FPGAs
Lecture Notes in Computer Science | 2010-08-31 | Paper |
LLL: a tool for effective Diophantine approximation
The LLL Algorithm | 2010-03-05 | Paper |
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
| Time- and space-efficient evaluation of some hypergeometric constants | 2009-01-20 | Paper |
MPFR
ACM Transactions on Mathematical Software | 2008-12-21 | Paper |
Primality Proving with Elliptic Curves
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Moyennes de certaines fonctions multiplicatives sur les entiers friables, 2
Proceedings of the London Mathematical Society | 2008-03-13 | Paper |
A long note on Mulders' short product
Journal of Symbolic Computation | 2007-08-24 | Paper |
| Some ideas on computational Diophantine equations | 2006-09-25 | Paper |
Proposal for a standardization of mathematical function implementation in floating-point arith\-metic
Numerical Algorithms | 2005-09-05 | 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 |
Density results on floating-point invertible numbers.
Theoretical Computer Science | 2003-01-21 | Paper |
Un nouveau critère pour l'équation de Catalan
Mathematika | 2002-12-15 | Paper |
On the Diophantine equation \((x^ n-1)/(x-1)=y^ q\). III
Proceedings of the London Mathematical Society. Third Series | 2002-01-28 | Paper |
Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
Journal für die Reine und Angewandte Mathematik | 2001-10-07 | Paper |
Almost perfect powers in consecutive integers
Acta Arithmetica | 2001-06-17 | Paper |
Thue equations with composite fields
Acta Arithmetica | 2000-04-26 | Paper |
Solving Thue equations without the full unit group
Mathematics of Computation | 1999-11-01 | Paper |
scientific article; zbMATH DE number 1187687 (Why is no real title available?)
Compositio Mathematica | 1999-07-06 | Paper |
Solving Thue equations of high degree
Journal of Number Theory | 1997-08-10 | Paper |
