| Publication | Date of Publication | Type |
|---|
| Sparse multiplication of multivariate linear differential operators | 2025-01-20 | Paper |
| Algorithms for linearly recurrent sequences of truncated polynomials | 2025-01-20 | Paper |
| An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases | 2024-12-09 | Paper |
| $p$-adic algorithm for bivariate Gr\"obner bases | 2023-12-21 | Paper |
| Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology | 2023-11-03 | Paper |
| Faster real root decision algorithm for symmetric polynomials | 2023-11-03 | Paper |
| p-adic algorithm for bivariate Gröbner bases | 2023-11-03 | Paper |
| Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results | 2023-08-10 | Paper |
| Sparse FGLM using the block Wiedemann algorithm | 2023-03-03 | Paper |
| Computing isomorphisms and embeddings of finite fields | 2023-03-03 | Paper |
| Newton iteration for lexicographic Gr\"obner bases in two variables | 2023-02-07 | Paper |
| Bit complexity for critical point computation in smooth and compact real hypersurfaces | 2023-01-11 | Paper |
| Bit complexity for computing one point in each connected component of a smooth real algebraic set | 2022-11-21 | Paper |
| Computing critical points for invariant algebraic systems | 2022-11-21 | Paper |
| Bit complexity for computing one point in each connected component of a smooth real algebraic set | 2022-07-09 | Paper |
| Homotopy techniques for solving sparse column support determinantal polynomial systems | 2021-09-02 | Paper |
| Subquadratic-time algorithms for normal bases | 2021-07-14 | Paper |
| Solving determinantal systems using homotopy techniques | 2021-02-18 | Paper |
| Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields | 2021-02-18 | Paper |
| Sparse multiplication for skew polynomials | 2021-01-22 | Paper |
| On the bit complexity of finding points in connected components of a smooth real hypersurface | 2021-01-22 | Paper |
| Algebraic construction of quasi-split algebraic tori | 2020-11-11 | Paper |
| Connectivity in Semi-Algebraic Sets I | 2020-11-04 | Paper |
| Foreword | 2020-09-19 | Paper |
| Computing the characteristic polynomial of a finite rank two Drinfeld module | 2020-09-10 | Paper |
| Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants | 2020-09-10 | Paper |
| Change of basis for \(\mathfrak{m}\)-primary ideals in one and two variables | 2020-09-10 | Paper |
| Quadratic-Time Algorithms for Normal Elements | 2020-09-10 | Paper |
| Fast computation of the roots of polynomials over the ring of power series | 2020-09-09 | Paper |
| Algorithms for structured linear systems solving and their implementation | 2020-09-09 | Paper |
| Sparse Rational Univariate Representation | 2020-09-09 | Paper |
| Computing syzygies in finite dimension using fast linear algebra | 2020-08-17 | Paper |
| Block-Krylov techniques in the context of sparse-FGLM algorithms | 2020-01-15 | Paper |
| Computing isomorphisms and embeddings of finite fields | 2019-01-31 | Paper |
| On semiring complexity of Schur polynomials | 2018-12-10 | Paper |
| Simultaneous conversions with the residue number system using linear algebra | 2018-08-17 | Paper |
| A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets | 2018-08-02 | Paper |
| Algorithms for zero-dimensional ideals using linear recurrent sequences | 2018-02-23 | Paper |
| On the evaluation of some sparse polynomials | 2018-01-12 | Paper |
| Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization | 2018-01-12 | Paper |
| On matrices with displacement structure: generalized operators and faster algorithms | 2017-08-14 | Paper |
| Solving structured linear systems of large displacement rank | 2017-06-27 | Paper |
| Computing minimal interpolation bases | 2017-06-01 | Paper |
| A fast algorithm for computing the truncated resultant | 2017-05-10 | Paper |
| Computation of the Similarity Class of the p-Curvature | 2017-05-10 | Paper |
| Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts | 2017-05-10 | Paper |
| Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations | 2017-04-28 | Paper |
| Explicit isogenies in quadratic time in any characteristic | 2017-04-04 | Paper |
| On the complexity of solving bivariate systems | 2017-02-10 | Paper |
| Fast algorithms for \(\ell\)-adic towers over finite fields | 2017-02-10 | Paper |
| Structured FFT and TFT: symmetric and lattice polynomials | 2017-02-10 | Paper |
| Change of order for bivariate triangular sets | 2017-02-03 | Paper |
| Algorithms for finite field arithmetic | 2016-09-29 | Paper |
| A fast algorithm for computing the \(p\)-curvature | 2016-09-29 | Paper |
| A quadratically convergent algorithm for structured low-rank approximation | 2016-05-19 | Paper |
| A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers | 2016-04-20 | Paper |
| A standard basis free algorithm for computing the tangent cones of a space curve | 2015-11-25 | Paper |
| A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature | 2015-11-11 | Paper |
| Fast arithmetic for the algebraic closure of finite fields | 2015-11-11 | Paper |
| A simple and fast online power series multiplication and its analysis | 2015-08-19 | Paper |
| Lifting techniques for triangular decompositions | 2015-07-16 | Paper |
| Multivariate power series multiplication | 2015-07-16 | Paper |
| Algorithms for the universal decomposition algebra | 2015-03-27 | Paper |
| Power series solutions of singular \((q)\)-differential equations | 2015-03-27 | Paper |
| Computing in degree \(2^k\)-extensions of finite fields of odd characteristic | 2015-03-12 | Paper |
| transalpyne: a language for automatic transposition | 2015-02-26 | Paper |
| Complexity and performance results for non FFT-based univariate polynomial multiplication | 2015-02-20 | Paper |
| Almost linear time operations with triangular sets | 2015-02-20 | Paper |
| Optimization techniques for small matrix multiplication | 2015-02-20 | Paper |
| transalpyne | 2015-02-20 | Paper |
| A baby step-giant step roadmap algorithm for general algebraic sets | 2015-01-16 | Paper |
| Fast computation of power series solutions of systems of differential equations | 2014-12-18 | Paper |
| Doing algebraic geometry with the RegularChains library | 2014-09-08 | Paper |
| Taking roots over high extensions of finite fields | 2013-11-15 | Paper |
| Modular composition modulo triangular sets and applications | 2013-09-30 | Paper |
| Multi-point evaluation in higher dimensions | 2013-02-21 | Paper |
| On the complexity of computing with zero-dimensional triangular sets | 2013-01-10 | Paper |
| Inversion modulo zero-dimensional regular chains | 2012-09-21 | Paper |
| Fast arithmetics in Artin-Schreier towers over finite fields | 2012-05-23 | Paper |
| Fast arithmetics in Artin-Schreier towers over finite fields | 2012-05-13 | Paper |
| Fast algorithms for differential equations in positive characteristic | 2012-05-13 | Paper |
| Genus 2 point counting over prime fields | 2012-05-04 | Paper |
| Bit-size estimates for triangular sets in positive dimension | 2012-01-10 | Paper |
| Homotopy techniques for multiplication modulo triangular sets | 2011-12-19 | Paper |
| The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} | 2011-06-01 | Paper |
| Optimization techniques for small matrix multiplication | 2011-05-10 | Paper |
| A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface | 2011-03-10 | Paper |
| Fast multivariate power series multiplication in characteristic zero | 2011-01-27 | Paper |
| A simple and fast algorithm for computing exponentials of power series | 2010-08-20 | Paper |
| Fast algorithms for computing isogenies between elliptic curves | 2010-08-03 | Paper |
| On the complexity of the D5 principle | 2010-06-17 | Paper |
| On the geometry of polar varieties | 2010-03-01 | Paper |
| Fast conversion algorithms for orthogonal polynomials | 2009-12-18 | Paper |
| Code Generation for Polynomial Multiplication | 2009-11-10 | Paper |
| Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering | 2009-11-03 | Paper |
| Evaluation properties of invariant polynomials | 2009-10-09 | Paper |
| Interpolation of polynomials given by straight-line programs | 2009-07-10 | Paper |
| Fast arithmetic for triangular sets: from theory to practice | 2009-06-18 | Paper |
| Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts | 2009-01-20 | Paper |
| Differential equations for algebraic functions | 2009-01-20 | Paper |
| Fast arithmetic for triangular sets: from theory to practice | 2009-01-20 | Paper |
| Solving Toeplitz- and Vandermonde-like linear systems with large displacement rank | 2009-01-20 | Paper |
| Power series composition and change of basis | 2009-01-20 | Paper |
| Solving structured linear systems with large displacement rank | 2008-11-18 | Paper |
| Change of order for regular chains in positive dimension | 2008-03-11 | Paper |
| Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator | 2008-01-03 | Paper |
| Fast computation of special resultants | 2007-10-23 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Change of ordering for regular chains in positive dimension | 2007-01-22 | Paper |
| EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS | 2006-08-14 | Paper |
| There is no efficient reverse derivation mode for discrete derivatives | 2005-12-29 | Paper |
| Polynomial evaluation and interpolation on special sets of points | 2005-09-02 | Paper |
| Algorithmic Number Theory | 2005-08-12 | Paper |
| Uniform bounds on the number of rational points of a family of curves of genus 2 | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660643 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660671 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660711 | 2005-04-04 | Paper |
| Sharp estimates for triangular sets | 2005-03-14 | Paper |
| Complexity issues in bivariate polynomial factorization | 2005-03-14 | Paper |
| On the complexities of multipoint evaluation and interpolation | 2005-02-09 | Paper |
| Properness defects and projections and computation of at least one point in each connected component of a real algebraic set | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4832276 | 2005-01-04 | Paper |
| Modular equations for hyperelliptic curves | 2004-10-07 | Paper |
| Complexity results for triangular sets | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474273 | 2004-08-04 | Paper |
| Fast algorithms for zero-dimensional polynomial systems using duality | 2004-02-05 | Paper |
| Computing parametric geometric resolutions | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531853 | 2002-05-23 | Paper |
| Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity | N/A | Paper |
