| Publication | Date of Publication | Type |
|---|
| Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices | 2025-01-20 | Paper |
| Bivariate polynomial reduction and elimination ideal over finite fields | 2024-10-08 | Paper |
| High-order lifting for polynomial Sylvester matrices | 2024-02-05 | Paper |
| Exact computations with quasiseparable matrices | 2023-11-03 | Paper |
| Elimination ideal and bivariate resultant over finite fields | 2023-11-03 | Paper |
| On Computing the Resultant of Generic Bivariate Polynomials | 2020-09-09 | Paper |
| Computing an LLL-reduced Basis of the Orthogonal Latice | 2020-09-09 | Paper |
| Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits | 2020-09-09 | Paper |
| Fast computation of approximant bases in canonical form | 2020-01-15 | Paper |
| Computing minimal interpolation bases | 2017-06-01 | Paper |
| Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix | 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 |
| A new view on HJLS and PSLQ | 2017-02-10 | Paper |
| Solving sparse rational linear systems | 2017-02-03 | Paper |
| Integer Smith form via the valence | 2015-11-26 | Paper |
| LLL reducing with the most significant bits | 2015-11-11 | Paper |
| Computing the rank and a small nullspace basis of a polynomial matrix | 2015-07-16 | Paper |
| An LLL-reduction algorithm with quasi-linear time complexity | 2014-06-05 | Paper |
| Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction | 2012-06-29 | Paper |
| H-LLL: using Householder inside LLL | 2012-05-13 | Paper |
| Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation | 2011-06-01 | Paper |
| Faster inversion and other black box matrix computations using efficient block projections | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301693 | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301698 | 2009-01-20 | Paper |
| Asymptotically fast polynomial matrix algorithms for multivariable systems | 2007-10-31 | Paper |
| Normal forms for general polynomial matrices | 2007-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660659 | 2005-04-04 | Paper |
| On the complexity of computing determinants | 2005-03-01 | Paper |
| Essentially optimal computation of the inverse of generic polynomial matrices | 2005-02-22 | Paper |
| Block solution of sparse linear systems over GF (q) | 2004-09-01 | Paper |
| On efficient sparse integer matrix Smith normal form computations | 2004-08-06 | Paper |
| A rank theorem for Vandermonde matrices | 2004-08-06 | Paper |
| Matrix rank certification | 2004-02-15 | Paper |
| Computing the sign or the value of the determinant of an integer matrix, a complexity survey. | 2004-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550785 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790434 | 2003-01-28 | Paper |
| Efficient matrix preconditioners for black box linear algebra | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234329 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2702027 | 2002-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520739 | 2001-02-27 | Paper |
| Processor Efficient Parallel Solution of Linear Systems of Equations | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234198 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234250 | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4237426 | 1999-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227300 | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227350 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226935 | 1999-02-23 | Paper |
| Fast parallel algorithms for matrix reduction to normal forms | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888753 | 1996-08-19 | Paper |
| Generalized subresultants for computing the Smith normal form of polynomial matrices | 1996-06-04 | Paper |
| Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors | 1989-01-01 | Paper |
| Computer algebra on MIMD machine | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753518 | 1989-01-01 | Paper |
