Gaussian Elimination on Message Passing Architecture. - Michel Cosnard; Bernard Tourancheau; Gilles Villard (ICS, 1987)

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

Computer algebra on MIMD machine. - Jean-Louis Roch; Pascale Sénéchaud; Françoise Siebert-Roch; Gilles Villard (SIGSAM Bull., 1989)

Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors. - Yves Robert; Bernard Tourancheau; Gilles Villard (Inf. Process. Lett., 1989)

PAC: First Experiments on a 128 Transputers Méganode. - Françoise Roch-Siebert; Gilles Villard (ISSAC, 1991)

Parallel gcd and Lattice Basis Reduction. - Jean-Louis Roch; Gilles Villard (CONPAR, 1992)

Cost Prediction for Load Balancing: Application to Algebraic Computations. - Jean-Louis Roch; A. Vermeerbergen; Gilles Villard (CONPAR, 1992)

Parallel Lattice Basis Reduction. - Gilles Villard (ISSAC, 1992)

Computation of the Smith Normal Form of Polynomial Matrices. - Gilles Villard (ISSAC, 1993)

A New Load-Prediction Scheme Based on Algorithmic Cost Functions. - Jean-Louis Roch; A. Vermeerbergen; Gilles Villard (CONPAR, 1994)

Fast Parallel Computation of the Smith Normal Form of Polynomial Matrices. - Gilles Villard (ISSAC, 1994)

Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices. - Jean-Louis Roch; Gilles Villard (PARLE, 1994)

Regular versus Irregular Problems and Algorithms. - Thierry Gautier; Jean-Louis Roch; Gilles Villard (IRREGULAR, 1995)

An Algorithm for the Reduction of Linear DAE. - M. P. Quéré; Gilles Villard (ISSAC, 1995)

Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices. - Gilles Villard (J. Symb. Comput., 1995)

Computing Popov and Hermite Forms of Polynomial Matrices. - Gilles Villard (ISSAC, 1996)

Fast Parallel Computation of the Jordan Normal Form of Matrices. - Jean-Louis Roch; Gilles Villard (Parallel Process. Lett., 1996)

Forword to the Special Issue on Real Numbers and Computers. - Jean-Claude Bajard; Christiane Frougny; Jean-Michel Muller; Gilles Villard (Theor. Comput. Sci., 1996)

Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract). - Gilles Villard (ISSAC, 1997)

Fast Parallel Algorithms for Matrix Reduction to Normal Forms. - Gilles Villard (Appl. Algebra Eng. Commun. Comput., 1997)

Block solution of sparse linear systems over GF (q): the singular case. - Gilles Villard (SIGSAM Bull., 1998)

Global Error Visualization. - René Aïd; Laurent Testard; Gilles Villard (J. Univers. Comput. Sci., 1998)

Shifted Normal Forms of Polynomial Matrices. - Bernhard Beckermann; George Labahn; Gilles Villard (ISSAC, 1999)

Computing the Determinant and Smith Form of an Integer Matrix. - Wayne Eberly; Mark Giesbrecht; Gilles Villard (FOCS, 2000)

Integer Smith form via the valence: experience with large sparse matrices from homology. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (ISSAC, 2000)

Processor Efficient Parallel Solution of Linear Systems of Equations. - Gilles Villard (J. Algorithms, 2000)

On Efficient Sparse Integer Matrix Smith Normal Form Computations. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (J. Symb. Comput., 2001)

Preface. - Gilles Villard (J. Symb. Comput., 2002)

On the complexity of polynomial matrix computations. - Pascal Giorgi; Claude-Pierre Jeannerod; Gilles Villard (ISSAC, 2003)

Computing the rank and a small nullspace basis of a polynomial matrix. - Arne Storjohann; Gilles Villard (ISSAC, 2005)

On the complexity of computing determinants. - Erich L. Kaltofen; Gilles Villard (Comput. Complex., 2005)

Asymptotically fast polynomial matrix algorithms for multivariable systems - Claude-Pierre Jeannerod; Gilles Villard (CoRR, 2005)

Computing the Kalman form - Clément Pernet; Aude Rondepierre; Gilles Villard (CoRR, 2005)

Essentially optimal computation of the inverse of generic polynomial matrices. - Claude-Pierre Jeannerod; Gilles Villard (J. Complex., 2005)

Lattice-Based Memory Allocation. - Alain Darte; Robert Schreiber; Gilles Villard (IEEE Trans. Computers, 2005)

Solving sparse rational linear systems. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2006)

Solving Sparse Integer Linear Systems - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (CoRR, 2006)

Normal forms for general polynomial matrices. - Bernhard Beckermann; George Labahn; Gilles Villard (J. Symb. Comput., 2006)

Faster inversion and other black box matrix computations using efficient block projections. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2007)

Certification of the QR factor R and of lattice basis reducedness. - Gilles Villard (ISSAC, 2007)

Some recent progress in exact linear algebra and related questions. - Gilles Villard (ISSAC, 2007)

From an LLL-reduced basis to another. - Ivan Morel; Damien Stehlé; Gilles Villard (ACM Commun. Comput. Algebra, 2008)

Differentiation of Kaltofen's division-free determinant algorithm - Gilles Villard (CoRR, 2008)

A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor. - Claude-Pierre Jeannerod; Herve Knochel; Christophe Monat; Guillaume Revy; Gilles Villard (IEEE Symposium on Computer Arithmetic, 2009)

H-LLL: using householder inside LLL. - Ivan Morel; Damien Stehlé; Gilles Villard (ISSAC, 2009)

Extending Cardinal's algorithm to a broader class of structured matrices. - Claude-Pierre Jeannerod; Christophe Mouilleron; Gilles Villard (ACM Commun. Comput. Algebra, 2009)

Analyse numérique et réduction de réseaux. - Ivan Morel; Damien Stehlé; Gilles Villard (Tech. Sci. Informatiques, 2010)

Recent progress in linear algebra and lattice basis reduction. - Gilles Villard (ISSAC, 2011)

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. - Andrew Novocin; Damien Stehlé; Gilles Villard (STOC, 2011)

Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation. - Gilles Villard (J. Symb. Comput., 2011)

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. - Xiao-Wen Chang; Damien Stehlé; Gilles Villard (Math. Comput., 2012)

A new view on HJLS and PSLQ: sums and projections of lattices. - Jingwei Chen; Damien Stehlé; Gilles Villard (ISSAC, 2013)

LLL reducing with the most significant bits. - Saruchi; Ivan Morel; Damien Stehlé; Gilles Villard (ISSAC, 2014)

Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. - Muhammad F. I. Chowdhury; Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (IEEE Trans. Inf. Theory, 2015)

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. - Jean-Guillaume Dumas; Erich L. Kaltofen; Emmanuel Thomé; Gilles Villard (ISSAC, 2016)

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (ISSAC, 2016)

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. - Jean-Guillaume Dumas; Erich L. Kaltofen; Gilles Villard; Lihong Zhi (ISSAC, 2017)

Computing minimal interpolation bases. - Claude-Pierre Jeannerod; Vincent Neiger; Éric Schost; Gilles Villard (J. Symb. Comput., 2017)

Computing an LLL-reduced Basis of the Orthogonal Latice. - Jingwei Chen; Damien Stehlé; Gilles Villard (ISSAC, 2018)

On Computing the Resultant of Generic Bivariate Polynomials. - Gilles Villard (ISSAC, 2018)

Computing an LLL-reduced basis of the orthogonal lattice. - Jingwei Chen; Damien Stehlé; Gilles Villard (CoRR, 2018)

Fast computation of approximant bases in canonical form. - Claude-Pierre Jeannerod; Vincent Neiger; Gilles Villard (J. Symb. Comput., 2020)

Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. - Pierre Karpman; Clément Pernet; Hippolyte Signargout; Gilles Villard (ISSAC, 2021)

Exact computations with quasiseparable matrices. - Clément Pernet; Hippolyte Signargout; Gilles Villard (ISSAC, 2023)

Elimination ideal and bivariate resultant over finite fields. - Gilles Villard (ISSAC, 2023)

Computing Krylov iterates in the time of matrix multiplication. - Vincent Neiger; Clément Pernet; Gilles Villard (ISSAC, 2024)

High-order lifting for polynomial Sylvester matrices. - Clément Pernet; Hippolyte Signargout; Gilles Villard (J. Complex., 2024)

Faster Modular Composition. - Vincent Neiger; Bruno Salvy; Éric Schost; Gilles Villard (J. ACM, 2024)

Bivariate polynomial reduction and elimination ideal over finite fields. - Gilles Villard (J. Symb. Comput., 2025)