| Publication | Date of Publication | Type |
|---|
| On parametric linear system solving | 2022-12-21 | Paper |
| Bit complexity for computing one point in each connected component of a smooth real algebraic set | 2022-11-21 | Paper |
| Bit complexity for computing one point in each connected component of a smooth real algebraic set | 2022-07-09 | Paper |
| Efficient rational creative telescoping | 2021-09-29 | Paper |
| Subquadratic-time algorithms for normal bases | 2021-07-14 | Paper |
| Efficient \(q\)-integer linear decomposition of multivariate polynomials | 2021-06-03 | Paper |
| Counting invariant subspaces and decompositions of additive polynomials | 2021-02-18 | Paper |
| On the bit complexity of finding points in connected components of a smooth real hypersurface | 2021-01-22 | Paper |
| Sparse multiplication for skew polynomials | 2021-01-22 | Paper |
| Computing nearby non-trivial Smith forms | 2020-09-19 | Paper |
| Efficient Integer-Linear Decomposition of Multivariate Polynomials | 2020-09-10 | Paper |
| Quadratic-Time Algorithms for Normal Elements | 2020-09-10 | Paper |
| Computing nearby non-trivial Smith forms | 2020-09-09 | Paper |
| Computing the Nearest Rank-Deficient Matrix Polynomial | 2020-09-09 | Paper |
| Computing approximate greatest common right divisors of differential polynomials | 2020-04-01 | Paper |
| Computing lower rank approximations of matrix polynomials | 2020-01-15 | Paper |
| Towards factoring bivariate approximate polynomials | 2017-02-03 | Paper |
| Solving sparse rational linear systems | 2017-02-03 | Paper |
| Symbolic-numeric sparse interpolation of multivariate polynomials | 2017-02-03 | Paper |
| Computing GCRDs of approximate differential polynomials | 2016-09-29 | Paper |
| Factorizations for difference operators | 2016-09-02 | Paper |
| Computing Popov Forms of Matrices Over PBW Extensions | 2016-04-12 | Paper |
| A Symbolic Approach to Compute a Null-Space Basis in the Projection Method | 2016-04-12 | Paper |
| Faster sparse multivariate polynomial interpolation of straight-line programs | 2016-02-11 | Paper |
| Factoring linear partial differential operators in \(n\) variables | 2016-02-11 | Paper |
| Sparse interpolation over finite fields via low-order roots of unity | 2015-11-11 | Paper |
| Factoring linear differential operators in n variables | 2015-11-11 | Paper |
| Composition collisions and projective polynomials | 2015-09-17 | Paper |
| Relating \(p\)-adic eigenvalues and the local Smith normal form | 2015-06-18 | Paper |
| Diversification improves interpolation | 2015-06-09 | Paper |
| Fast computation of Smith forms of sparse matrices over local rings | 2015-03-27 | Paper |
| ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics | 2015-02-24 | Paper |
| Faster Sparse Interpolation of Straight-Line Programs | 2014-07-07 | Paper |
| Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices | 2014-01-26 | Paper |
| Computing the Hermite form of a matrix of Ore polynomials | 2013-08-26 | Paper |
| Computing sparse multiples of polynomials | 2013-01-28 | Paper |
| A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials | 2012-09-21 | Paper |
| In honour of the research and influence of Joachim von zur Gathen at 60 | 2012-05-04 | Paper |
| Detecting lacunary perfect powers and computing their roots | 2011-12-07 | Paper |
| In honour of Keith Geddes on his 60th birthday | 2011-06-01 | Paper |
| Interpolation of shifted-lacunary polynomials | 2011-02-18 | Paper |
| Computing Sparse Multiples of Polynomials | 2010-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188230 | 2010-03-10 | Paper |
| On Computing the Hermite Form of a Matrix of Differential Polynomials | 2009-11-10 | Paper |
| Symbolic-numeric sparse interpolation of multivariate polynomials | 2009-06-11 | Paper |
| On lacunary polynomial perfect powers | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301663 | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447172 | 2007-06-28 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660658 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660691 | 2005-04-04 | Paper |
| Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474265 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471950 | 2004-07-30 | Paper |
| Efficient decomposition of separable algebras. | 2004-06-22 | Paper |
| Computing rational forms of integer matrices | 2003-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790434 | 2003-01-28 | Paper |
| Fast computation of the Smith form of a sparse integer matrix | 2002-09-22 | Paper |
| Efficient decomposition of associative algebras over finite fields | 2002-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234328 | 2001-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2725953 | 2001-07-12 | Paper |
| Factoring in skew-polynomial rings over finite fields | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226997 | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232484 | 1999-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227340 | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230333 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227282 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375610 | 1998-05-06 | Paper |
| Nearly Optimal Algorithms for Canonical Matrix Forms | 1996-06-02 | Paper |
| Constructing normal bases in finite fields | 1990-01-01 | Paper |
