Gilles Villard

J. Symb. Comput., 2025

2024

Faster Modular Composition.

[BibT_eX]

[DOI]

J. ACM, April, 2024

High-order lifting for polynomial Sylvester matrices.

[BibT_eX]

[DOI]

Hippolyte Signargout

J. Complex., February, 2024

Computing Krylov iterates in the time of matrix multiplication.

[BibT_eX]

[DOI]

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023

Elimination ideal and bivariate resultant over finite fields.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Exact computations with quasiseparable matrices.

[BibT_eX]

[DOI]

Hippolyte Signargout

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021

Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Fast computation of approximant bases in canonical form.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

2018

Computing an LLL-reduced basis of the orthogonal lattice.

[BibT_eX]

[DOI]

Jingwei Chen

CoRR, 2018

On Computing the Resultant of Generic Bivariate Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Computing an LLL-reduced Basis of the Orthogonal Latice.

[BibT_eX]

[DOI]

Jingwei Chen

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

Computing minimal interpolation bases.

[BibT_eX]

[DOI]

Éric Schost

J. Symb. Comput., 2017

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts.

[BibT_eX]

[DOI]

Éric Schost

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations.

[BibT_eX]

[DOI]

Muhammad F. I. Chowdhury

Éric Schost

IEEE Trans. Inf. Theory, 2015

2014

LLL reducing with the most significant bits.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

A new view on HJLS and PSLQ: sums and projections of lattices.

[BibT_eX]

[DOI]

Jingwei Chen

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction.

[BibT_eX]

[DOI]

Xiao-Wen Chang

Math. Comput., 2012

2011

Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract.

[BibT_eX]

[DOI]

Andrew Novocin

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Recent progress in linear algebra and lattice basis reduction.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Analyse numérique et réduction de réseaux.

[BibT_eX]

[DOI]

Ivan Morel

Tech. Sci. Informatiques, 2010

2009

Extending Cardinal's algorithm to a broader class of structured matrices.

[BibT_eX]

[DOI]

Christophe Mouilleron

ACM Commun. Comput. Algebra, 2009

H-LLL: using householder inside LLL.

[BibT_eX]

[DOI]

Ivan Morel

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

2008

Differentiation of Kaltofen's division-free determinant algorithm

[BibT_eX]

[DOI]

CoRR, 2008

From an LLL-reduced basis to another.

[BibT_eX]

[DOI]

Ivan Morel

ACM Commun. Comput. Algebra, 2008

2007

Some recent progress in exact linear algebra and related questions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Certification of the QR factor R and of lattice basis reducedness.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Faster inversion and other black box matrix computations using efficient block projections.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Normal forms for general polynomial matrices.

[BibT_eX]

[DOI]

Bernhard Beckermann

George Labahn

J. Symb. Comput., 2006

Solving Sparse Integer Linear Systems

[BibT_eX]

[DOI]

CoRR, 2006

Solving sparse rational linear systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Lattice-Based Memory Allocation.

[BibT_eX]

[DOI]

Alain Darte

Robert Schreiber

IEEE Trans. Computers, 2005

Essentially optimal computation of the inverse of generic polynomial matrices.

[BibT_eX]

[DOI]

J. Complex., 2005

Computing the Kalman form

[BibT_eX]

[DOI]

Aude Rondepierre

CoRR, 2005

Asymptotically fast polynomial matrix algorithms for multivariable systems

[BibT_eX]

[DOI]

CoRR, 2005

On the complexity of computing determinants.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Comput. Complex., 2005

Computing the rank and a small nullspace basis of a polynomial matrix.

[BibT_eX]

[DOI]

Arne Storjohann

Proceedings of the Symbolic and Algebraic Computation, 2005

2003

On the complexity of polynomial matrix computations.

[BibT_eX]

[DOI]

Pascal Giorgi

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Preface.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

2001

On Efficient Sparse Integer Matrix Smith Normal Form Computations.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

B. David Saunders

J. Symb. Comput., 2001

2000

Processor Efficient Parallel Solution of Linear Systems of Equations.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Integer Smith form via the valence: experience with large sparse matrices from homology.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

B. David Saunders

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Computing the Determinant and Smith Form of an Integer Matrix.

[BibT_eX]

[DOI]

Wayne Eberly

Mark Giesbrecht

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Shifted Normal Forms of Polynomial Matrices.

[BibT_eX]

[DOI]

Bernhard Beckermann

George Labahn

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

Global Error Visualization.

[BibT_eX]

[DOI]

René Aïd

Laurent Testard

J. Univers. Comput. Sci., 1998

Block solution of sparse linear systems over GF (q): the singular case.

[BibT_eX]

[DOI]

SIGSAM Bull., 1998

1997

Fast Parallel Algorithms for Matrix Reduction to Normal Forms.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996

Forword to the Special Issue on Real Numbers and Computers.

[BibT_eX]

Theor. Comput. Sci., 1996

Fast Parallel Computation of the Jordan Normal Form of Matrices.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1996

Computing Popov and Hermite Forms of Polynomial Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

An Algorithm for the Reduction of Linear DAE.

[BibT_eX]

[DOI]

M. P. Quéré

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

Regular versus Irregular Problems and Algorithms.

[BibT_eX]

[DOI]

Thierry Gautier

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994

Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices.

[BibT_eX]

[DOI]

Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

Fast Parallel Computation of the Smith Normal Form of Polynomial Matrices.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

A New Load-Prediction Scheme Based on Algorithmic Cost Functions.

[BibT_eX]

[DOI]

A. Vermeerbergen

Proceedings of the Parallel Processing: CONPAR 94, 1994

1993

Computation of the Smith Normal Form of Polynomial Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992

Parallel Lattice Basis Reduction.

[BibT_eX]

[DOI]

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Cost Prediction for Load Balancing: Application to Algebraic Computations.

[BibT_eX]

[DOI]

A. Vermeerbergen

Proceedings of the Parallel Processing: CONPAR 92, 1992

Parallel gcd and Lattice Basis Reduction.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

PAC: First Experiments on a 128 Transputers Méganode.

[BibT_eX]

[DOI]

Françoise Roch-Siebert

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1989

Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors.

[BibT_eX]

[DOI]

Yves Robert

Bernard Tourancheau

Inf. Process. Lett., 1989

Computer algebra on MIMD machine.

[BibT_eX]

[DOI]

Pascale Sénéchaud

Françoise Siebert-Roch

SIGSAM Bull., 1989

1988

Calcul formel et parallélisme : résolution de systèmes linéaires. (Parallel algebraic computation. Solution of linear systems).

[BibT_eX]

[DOI]

PhD thesis, 1988

1987

Gaussian Elimination on Message Passing Architecture.

[BibT_eX]

[DOI]

Michel Cosnard

Bernard Tourancheau