| Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. | 0 | 0.34 | 2021 |
| Computing An Lll-Reduced Basis Of The Orthogonal Lattice | 0 | 0.34 | 2018 |
| On Computing The Resultant Of Generic Bivariate Polynomials | 1 | 0.37 | 2018 |
| Fast computation of approximant bases in canonical form. | 0 | 0.34 | 2018 |
| Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. | 0 | 0.34 | 2017 |
| Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. | 8 | 0.47 | 2016 |
| Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. | 6 | 0.54 | 2016 |
| Computing minimal interpolation bases. | 4 | 0.44 | 2015 |
| LLL reducing with the most significant bits | 3 | 0.42 | 2014 |
| Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations | 12 | 0.60 | 2014 |
| A new view on HJLS and PSLQ: sums and projections of lattices | 4 | 0.48 | 2013 |
| Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. | 9 | 0.74 | 2012 |
| Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation | 0 | 0.34 | 2011 |
| An LLL-reduction algorithm with quasi-linear time complexity: extended abstract | 23 | 1.14 | 2011 |
| Recent progress in linear algebra and lattice basis reduction | 0 | 0.34 | 2011 |
| Analyse numérique et réduction de réseaux | 0 | 0.34 | 2010 |
| Extending Cardinal's algorithm to a broader class of structured matrices | 0 | 0.34 | 2009 |
| A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor | 5 | 0.96 | 2009 |
| H-LLL: using householder inside LLL | 17 | 1.00 | 2009 |
| Differentiation of Kaltofen's division-free determinant algorithm | 0 | 0.34 | 2008 |
| From an LLL-reduced basis to another | 4 | 0.47 | 2008 |
| Certification of the QR factor R and of lattice basis reducedness | 8 | 0.82 | 2007 |
| Faster inversion and other black box matrix computations using efficient block projections | 16 | 0.82 | 2007 |
| Some recent progress in exact linear algebra and related questions | 1 | 0.37 | 2007 |
| Normal forms for general polynomial matrices | 31 | 1.81 | 2006 |
| Solving Sparse Integer Linear Systems | 2 | 0.38 | 2006 |
| Solving sparse rational linear systems | 19 | 0.86 | 2006 |
| Computing the Kalman form | 0 | 0.34 | 2005 |
| Computing the rank and a small nullspace basis of a polynomial matrix | 19 | 1.25 | 2005 |
| Asymptotically Fast Polynomial Matrix Algorithms For Multivariable Systems | 9 | 0.71 | 2005 |
| Essentially optimal computation of the inverse of generic polynomial matrices | 16 | 1.25 | 2005 |
| Lattice-Based Memory Allocation | 51 | 2.05 | 2005 |
| On the complexity of computing determinants | 63 | 5.41 | 2005 |
| On the complexity of polynomial matrix computations | 74 | 3.64 | 2003 |
| On efficient sparse integer matrix Smith normal form computations | 41 | 4.05 | 2001 |
| Processor efficient parallel solution of linear systems of equations | 1 | 0.37 | 2000 |
| Integer Smith form via the valence: experience with large sparse matrices from homology | 12 | 1.20 | 2000 |
| Shifted normal forms of polynomial matrices | 22 | 1.64 | 1999 |
| Global Error Visualization | 0 | 0.34 | 1998 |
| Block solution of sparse linear systems over GF (q): the singular case | 1 | 0.38 | 1998 |
| Fast Parallel Algorithms for Matrix Reduction to Normal Forms. | 6 | 0.66 | 1997 |
| Fast Parallel Computation of the Jordan Normal Form of Matrices | 3 | 0.41 | 1996 |
| Forword to the Special Issue on Real Numbers and Computers | 0 | 0.34 | 1996 |
| Regular versus Irregular Problems and Algorithms | 11 | 0.82 | 1995 |
| Generalized subresultants for computing the Smith normal form of polynomial matrices | 12 | 1.36 | 1995 |
| Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices | 5 | 0.51 | 1994 |
| A New Load-Prediction Scheme Based on Algorithmic Cost Functions | 2 | 0.63 | 1994 |
| Fast parallel computation of the Smith normal form of polynomial matrices | 5 | 0.51 | 1994 |
| Computation of the Smith normal form of polynomial matrices | 3 | 0.47 | 1993 |
| Cost Prediction for Load Balancing: Application to Algebraic Computations | 2 | 0.41 | 1992 |
