Gilles Villard

发表

Computing LLL-Reduced Basis for Orthogonal Lattice

Damien Stehlé, Jingwei Chen, Gilles Villard, 2018, ISSAC 2018.

LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA

Erich Kaltofen, Jean-Guillaume Dumas, Gilles Villard, 2002 .

An algorithm for the reduction of linear DAE

Gilles Villard, M. P. Quéré, G. Villard, 1995, ISSAC '95.

Processor Efficient Parallel Solution of Linear Systems of Equations

Gilles Villard, G. Villard, 2000, J. Algorithms.

Computation of the Smith normal form of polynomial matrices

Gilles Villard, G. Villard, 1993, ISSAC '93.

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

Gilles Villard, G. Villard, 2008, J. Symb. Comput..

Recent progress in linear algebra and lattice basis reduction

Gilles Villard, G. Villard, 2011, ISSAC '11.

Asymptotically fast polynomial matrix algorithms for multivariable systems

Claude-Pierre Jeannerod, Gilles Villard, G. Villard, 2005, ArXiv.

On Computing the Resultant of Generic Bivariate Polynomials

Gilles Villard, G. Villard, 2018, ISSAC.

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

Gilles Villard, Mark Giesbrecht, Pascal Giorgi, 2007, ISSAC '07.

Normal forms for general polynomial matrices

George Labahn, Gilles Villard, Bernhard Beckermann, 2006, J. Symb. Comput..

Computing an LLL-reduced Basis of the Orthogonal Latice

Damien Stehlé, Gilles Villard, Jingwei Chen, 2018, ISSAC.

Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)

Gilles Villard, G. Villard, 1997, ISSAC.

Fast computation of approximant bases in canonical form

Claude-Pierre Jeannerod, Gilles Villard, Vincent Neiger, 2018, J. Symb. Comput..

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001

Erich Kaltofen, Gilles Villard, E. Kaltofen, 2001, ISSAC.

Global Error Visualization

Gilles Villard, Laurent Testard, René Aïd, 1998, J. Univers. Comput. Sci..

PAC: first experiments on a 128 transputers méganode

Gilles Villard, Françoise Roch-Siebert, 1991, ISSAC '91.

Solving sparse rational linear systems

Gilles Villard, Mark Giesbrecht, Pascal Giorgi, 2006, ISSAC '06.

Regular versus Irregular Problems and Algorithms

Gilles Villard, Thierry Gautier, Jean-Louis Roch, 1995, IRREGULAR.

Fast Parallel Computation of the Jordan Normal Form of Matrices

Gilles Villard, Jean-Louis Roch, G. Villard, 1996, Parallel Process. Lett..

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

Gilles Villard, Jean-Louis Roch, G. Villard, 1994, PARLE.

On the complexity of polynomial matrix computations

Claude-Pierre Jeannerod, Gilles Villard, Pascal Giorgi, 2003, ISSAC '03.

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

Jean-Guillaume Dumas, B. David Saunders, Gilles Villard, 2000, ISSAC.

On computing the determinant and Smith form of an integer matrix

Gilles Villard, Mark Giesbrecht, Wayne Eberly, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Forword to the Special Issue on Real Numbers and Computers

Jean-Michel Muller, Gilles Villard, Christiane Frougny, 1996, Theor. Comput. Sci..

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

Damien Stehlé, Gilles Villard, Jingwei Chen, 2013, ISSAC '13.

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

Claude-Pierre Jeannerod, Éric Schost, Gilles Villard, 2016, ISSAC.

On Efficient Sparse Integer Matrix Smith Normal Form Computations

Jean-Guillaume Dumas, B. David Saunders, Gilles Villard, 2001, J. Symb. Comput..

Essentially optimal computation of the inverse of generic polynomial matrices

Claude-Pierre Jeannerod, Gilles Villard, 2005, J. Complex..

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

Damien Stehlé, Gilles Villard, Ivan Morel, 2010, Tech. Sci. Informatiques.

Computing Popov and Hermite forms of polynomial matrices

Gilles Villard, G. Villard, 1996, ISSAC '96.

Fast Parallel Algorithms for Matrix Reduction to Normal Forms

Gilles Villard, G. Villard, 1997, Applicable Algebra in Engineering, Communication and Computing.

Lattice-Based Memory Allocation

Gilles Villard, Alain Darte, Robert Schreiber, 2005, IEEE Trans. Computers.

Shifted normal forms of polynomial matrices

George Labahn, Gilles Villard, Bernhard Beckermann, 1999, ISSAC '99.

Parallel lattice basis reduction

Gilles Villard, G. Villard, 1992, ISSAC '92.

Solving Sparse Integer Linear Systems pdf

Gilles Villard, Mark Giesbrecht, Pascal Giorgi, 2006, ArXiv.

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

Erich Kaltofen, Lihong Zhi, Jean-Guillaume Dumas, 2017, ISSAC.

Lattice-based memory allocation

Gilles Villard, Alain Darte, Robert Schreiber, 2003, IEEE Transactions on Computers.

Computing the Kalman form pdf

Aude Rondepierre, Clément Pernet, Gilles Villard, 2005, ArXiv.

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

Claude-Pierre Jeannerod, Gilles Villard, Guillaume Revy, 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices

Gilles Villard, G. Villard, 1995, J. Symb. Comput..

LLL reducing with the most significant bits

Damien Stehlé, Gilles Villard, Saruchi, 2014, ISSAC.

Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations

Claude-Pierre Jeannerod, Éric Schost, Gilles Villard, 2014, IEEE Transactions on Information Theory.

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

Claude-Pierre Jeannerod, Gilles Villard, Christophe Mouilleron, 2010, ACCA.

Parallel gcd and Lattice Basis Reduction

Gilles Villard, Jean-Louis Roch, G. Villard, 1992, CONPAR.

Computer Algebra on MIMD Machine

Gilles Villard, Jean-Louis Roch, Pascale Sénéchaud, 1988, ISSAC.

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

Damien Stehlé, Gilles Villard, Andrew Novocin, 2011, STOC '11.

A New Load-Prediction Scheme Based on Algorithmic Cost Functions

Gilles Villard, Jean-Louis Roch, A. Vermeerbergen, 1994, CONPAR.

From an LLL-reduced basis to another

Damien Stehlé, Gilles Villard, Ivan Morel, 2009, ACCA.

Computer algebra on MIMD machine

Gilles Villard, Jean-Louis Roch, Pascale Sénéchaud, 1988, SIGS.

H-LLL: using householder inside LLL

Damien Stehlé, Gilles Villard, Ivan Morel, 2009, ISSAC '09.

Computing minimal interpolation bases pdf

Claude-Pierre Jeannerod, Éric Schost, Gilles Villard, 2015, J. Symb. Comput..

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

Gilles Villard, 1988 .

Some recent progress in exact linear algebra and related questions

Gilles Villard, G. Villard, 2007, ISSAC '07.

On the complexity of computing determinants

Erich Kaltofen, Gilles Villard, E. Kaltofen, 2001, computational complexity.

Cost Prediction for Load Balancing: Application to Algebraic Computations

Gilles Villard, Jean-Louis Roch, A. Vermeerbergen, 1992, CONPAR.

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

Gilles Villard, G. Villard, 2007, ISSAC '07.

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

Gilles Villard, Arne Storjohann, G. Villard, 2005, ISSAC.

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

Erich Kaltofen, Jean-Guillaume Dumas, Gilles Villard, 2016, ISSAC.

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

Damien Stehlé, Gilles Villard, Xiao-Wen Chang, 2012, Math. Comput..

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

Gilles Villard, G. Villard, 1998, SIGS.

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

Gilles Villard, Pierre Karpman, Cl'ement Pernet, 2021, ISSAC.

Faster Modular Composition pdf

Éric Schost, Gilles Villard, Bruno Salvy, 2021, ArXiv.

Exact computations on polynomial and integer matrices

Gilles Villard, 2003 .

High precision numerical accuracy in physics research

Florent de Dinechin, Gilles Villard, G. Villard, 2006 .

Computing the Rank of Large Sparse Matrices over Finite Fields

Jean-Guillaume Dumas, Gilles Villard, G. Villard, 2002 .

Computation of the Inverse and Determinant of a Matrix

Gilles Villard, G. Villard, 2003 .

ON THE COMPLEXITY OF COMPUTING DETERMINANTS

Erich Kaltofen, Gilles Villard, 2001 .

Parallel Computer Algebra 1

Gilles Villard, Jean-Louis Roch, G. Villard, 1997 .

Straight-line computation of the polynomial matrix inverse

Claude-Pierre Jeannerod, Gilles Villard, G. Villard, 2006 .

A rank theorem for Vandermonde matrices

Gilles Villard, Pascal Koiran, Natacha Portier, 2004 .

MATRIX RANK CERTIFICATION

B. David Saunders, Gilles Villard, Arne Storjohann, 2004 .