| Publication | Date of Publication | Type |
|---|
| Linear hensel lifting for zp[x,y for \(n\) factors with cubic cost] | 2025-01-17 | Paper |
| A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions | 2025-01-10 | Paper |
| Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions | 2024-05-03 | Paper |
| Solving Parametric Linear Systems Using Sparse Rational Function Interpolation | 2024-05-03 | Paper |
| A New Black Box Factorization Algorithm - the Non-monic Case | 2023-11-03 | Paper |
| Factoring non-monic polynomials represented by black boxes | 2023-08-02 | Paper |
| A new interpolation algorithm for computing dixon resultants | 2023-08-02 | Paper |
| Factoring multivariate polynomials represented by black boxes: a Maple + C implementation | 2023-01-27 | Paper |
| New bivariate Hensel lifting algorithm for n factors | 2023-01-11 | Paper |
| An interpolation algorithm for computing Dixon resultants | 2022-12-21 | Paper |
| The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization | 2022-12-21 | Paper |
| Implementing the Tangent Graeffe Root Finding Method | 2022-10-13 | Paper |
| A call to build a publicly accessible library of lecture recordings in computer algebra | 2022-09-06 | Paper |
| Computing one billion roots using the tangent Graeffe method | 2022-09-06 | Paper |
| A fast parallel sparse polynomial GCD algorithm | 2021-02-18 | Paper |
| Algorithms for computing greatest common divisors of parametric multivariate polynomials | 2020-09-19 | Paper |
| Linear Hensel Lifting for Fp[x,y and Z[x] with Cubic Cost] | 2020-09-10 | Paper |
| An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD | 2020-09-09 | Paper |
| Some results on counting roots of polynomials and the Sylvester resultant | 2020-05-26 | Paper |
| The complexity of sparse Hensel lifting and sparse polynomial factorization | 2020-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377432 | 2019-05-24 | Paper |
| Fast parallel multi-point evaluation of sparse polynomials | 2019-03-29 | Paper |
| Factoring multivariate polynomials with many factors and huge coefficients | 2018-10-23 | Paper |
| Sparse multivariate Hensel lifting: a high-performance design and implementation | 2018-08-17 | Paper |
| Using sparse interpolation to solve multivariate diophantine equations | 2017-06-22 | Paper |
| Computing characteristic polynomials of matrices of structured polynomials | 2017-06-21 | Paper |
| Fermat benchmarks for rational expressionals in maple | 2017-06-21 | Paper |
| A Fast Parallel Sparse Polynomial GCD Algorithm | 2017-05-10 | Paper |
| Algorithms for trigonometric polynomials | 2017-02-03 | Paper |
| Fast rational function reconstruction | 2017-02-03 | Paper |
| Rational simplification modulo a polynomial ideal | 2017-02-03 | Paper |
| Computing Characteristic Polynomials of Matrices of Structured Polynomials | 2016-11-09 | Paper |
| Using Sparse Interpolation in Hensel Lifting | 2016-11-09 | Paper |
| POLY: A New Polynomial Data Structure for Maple 17 | 2016-04-12 | Paper |
| On the design and implementation of Brown's algorithm over the integers and number fields | 2015-11-26 | Paper |
| Algorithms for the non-monic case of the sparse modular GCD algorithm | 2015-07-16 | Paper |
| Probabilistic algorithms for computing resultants | 2015-07-16 | Paper |
| The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects | 2015-03-18 | Paper |
| A fast recursive algorithm for computing cyclotomic polynomials | 2015-02-20 | Paper |
| On sparse interpolation over finite fields | 2015-02-20 | Paper |
| Sparse polynomial multiplication and division in Maple 14 | 2015-02-20 | Paper |
| Sparse Polynomial Powering Using Heaps | 2012-09-21 | Paper |
| On factorization of multivariate polynomials over algebraic number and function fields | 2012-05-13 | Paper |
| Parallel sparse polynomial multiplication using heaps | 2012-05-13 | Paper |
| Calculating cyclotomic polynomials | 2011-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012177 | 2011-07-05 | Paper |
| Sparse polynomial division using a heap | 2011-06-01 | Paper |
| Algorithms for solving linear systems over cyclotomic fields | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188268 | 2010-03-10 | Paper |
| Lazy and Forgetful Polynomial Arithmetic and Applications | 2009-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301669 | 2009-01-20 | Paper |
| Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors | 2008-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416643 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416658 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416669 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416682 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416693 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416705 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660692 | 2005-04-04 | Paper |
| Maximal quotient rational reconstruction | 2005-03-14 | Paper |
| Algorithms for polynomial GCD computation over algebraic function fields | 2005-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470456 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234326 | 2001-07-16 | Paper |
| PERTURBATIVE SOLUTIONS OF QUANTUM MECHANICAL PROBLEMS BY SYMBOLIC COMPUTATION: A REVIEW | 2000-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250163 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234177 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226972 | 1999-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382605 | 1998-03-19 | Paper |
| Two perturbation calculations in fluid mechanics using large-expression management | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359470 | 1997-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125574 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5690472 | 1997-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864705 | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139116 | 1993-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002478 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002421 | 1992-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4004141 | 1992-09-18 | Paper |
| A heuristic irreducibility test for univariate polynomials | 1992-06-28 | Paper |
| Perturbative solutions of quantum mechanical problems by symbolic computation | 1990-01-01 | Paper |
| The First Case of Fermat's Last Theorem is True for all Prime Exponents up to 714,591,416,091,389 | 1988-01-01 | Paper |
