| Publication | Date of Publication | Type |
|---|
| Amortized bivariate multi-point evaluation | 2025-01-20 | Paper |
| Fast interpolation of multivariate polynomials with sparse exponents | 2025-01-17 | Paper |
| Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities | 2024-11-01 | Paper |
| Univariate polynomial factorization over finite fields with large extension degree | 2024-03-01 | Paper |
| Ultimate complexity for numerical algorithms | 2023-01-10 | Paper |
| Amortized multi-point evaluation of multivariate polynomials | 2022-11-23 | Paper |
| Computing Riemann-Roch spaces via Puiseux expansions | 2022-09-12 | Paper |
| On sparse interpolation of rational functions and gcds | 2022-09-06 | Paper |
| A proof of the Brill-Noether method from scratch | 2022-08-26 | Paper |
| Fast amortized multi-point evaluation | 2021-11-02 | Paper |
| On the complexity exponent of polynomial system solving | 2021-03-23 | Paper |
| Fast computation of generic bivariate resultants | 2021-02-26 | Paper |
| Sub-quadratic time for riemann-roch spaces | 2021-01-22 | Paper |
| Composition Modulo Powers of Polynomials | 2020-09-09 | Paper |
| Directed evaluation | 2020-08-17 | Paper |
| Fast multivariate multi-point evaluation revisited | 2019-12-30 | Paper |
| Accelerated tower arithmetic | 2019-11-21 | Paper |
| Implementing Fast Carryless Multiplication | 2019-03-14 | Paper |
| On the complexity of the Lickteig-Roy subresultant algorithm | 2018-12-28 | Paper |
| Faster Polynomial Multiplication over Finite Fields | 2018-08-02 | Paper |
| Modular composition via factorization | 2018-07-27 | Paper |
| Modular SIMD arithmetic in M <scp>athemagix</scp> | 2018-07-20 | Paper |
| Preserving Syntactic Correctness While Editing Mathematical Formulas | 2018-04-05 | Paper |
| A short survey on Kantorovich | 2017-06-22 | Paper |
| Fast Polynomial Multiplication over F 2 60 | 2017-05-10 | Paper |
| Randomized root finding over finite FFT-fields using tangent Graeffe transforms | 2016-09-29 | Paper |
| Even faster integer multiplication | 2016-09-01 | Paper |
| Deterministic root finding over finite fields using Graeffe transforms | 2016-06-29 | Paper |
| Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions | 2015-11-26 | Paper |
| Degeneracy loci and polynomial equation solving | 2015-04-20 | Paper |
| On the complexity of multivariate blockwise polynomial multiplication | 2015-03-27 | Paper |
| Mathemagix | 2015-02-20 | Paper |
| Polynomial root finding over local rings and application to error correcting codes | 2014-03-24 | Paper |
| On the bit-complexity of sparse polynomial and series multiplication | 2013-01-10 | Paper |
| Relaxed algorithms for \(p\)-adic numbers | 2012-08-31 | Paper |
| Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations | 2012-06-29 | Paper |
| Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers | 2011-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070806 | 2011-01-27 | Paper |
| Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations | 2010-09-14 | Paper |
| New recombination algorithms for bivariate polynomial factorization based on Hensel lifting | 2010-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301646 | 2009-01-20 | Paper |
| Fast separable factorization and applications | 2008-05-14 | Paper |
| A concise proof of the Kronecker polynomial system solver from scratch | 2008-05-08 | Paper |
| Improved dense multivariate polynomial factorization algorithms | 2007-10-23 | Paper |
| Lifting and recombination techniques for absolute factorization | 2007-07-04 | Paper |
| On location and approximation of clusters of zeros: Case of embedding dimension one | 2007-03-12 | Paper |
| On location and approximation of clusters of zeros of analytic functions | 2006-09-28 | Paper |
| Sharp precision in Hensel lifting for bivariate polynomial factorization | 2006-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660643 | 2005-04-04 | Paper |
| Complexity issues in bivariate polynomial factorization | 2005-03-14 | Paper |
| Quadratic Newton iteration for systems with multiplicity | 2003-07-13 | Paper |
| A Gröbner free alternative for polynomial system solving | 2003-01-27 | Paper |
| The Projective Noether Maple Package: Computing the dimension of a projective variety | 2001-03-06 | Paper |
| Fast interpolation of sparse multivariate polynomials | N/A | Paper |
