default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilles Villard
Person information
- affiliation: ENS Lyon, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Vincent Neiger
, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. J. ACM 71(2): 11:1-11:79 (2024)- [j24]Clément Pernet, Hippolyte Signargout, Gilles Villard:
High-order lifting for polynomial Sylvester matrices. J. Complex. 80: 101803 (2024) - [c39]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. ISSAC 2024: 419-428 - [i19]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. CoRR abs/2402.07345 (2024) - 2023
- [c38]Clément Pernet, Hippolyte Signargout, Gilles Villard:
Exact computations with quasiseparable matrices. ISSAC 2023: 480-489 - [c37]Gilles Villard:
Elimination ideal and bivariate resultant over finite fields. ISSAC 2023: 526-534 - [i18]Clément Pernet, Hippolyte Signargout, Gilles Villard:
Exact computations with quasiseparable matrices. CoRR abs/2302.04515 (2023) - [i17]Gilles Villard:
Elimination ideal and bivariate resultant over finite fields. CoRR abs/2302.08891 (2023) - 2021
- [c36]Pierre Karpman, Clément Pernet, Hippolyte Signargout, Gilles Villard:
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. ISSAC 2021: 249-256 - [i16]Clément Pernet, Hippolyte Signargout, Pierre Karpman, Gilles Villard:
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. CoRR abs/2104.02497 (2021) - [i15]Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard:
Faster Modular Composition. CoRR abs/2110.08354 (2021) - 2020
- [j23]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. J. Symb. Comput. 98: 192-224 (2020)
2010 – 2019
- 2018
- [c35]Jingwei Chen, Damien Stehlé, Gilles Villard:
Computing an LLL-reduced Basis of the Orthogonal Latice. ISSAC 2018: 127-133 - [c34]Gilles Villard:
On Computing the Resultant of Generic Bivariate Polynomials. ISSAC 2018: 391-398 - [i14]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. CoRR abs/1801.04553 (2018) - [i13]Jingwei Chen, Damien Stehlé, Gilles Villard:
Computing an LLL-reduced basis of the orthogonal lattice. CoRR abs/1805.03418 (2018) - 2017
- [j22]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. J. Symb. Comput. 83: 272-314 (2017) - [c33]Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi:
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. ISSAC 2017: 125-132 - 2016
- [c32]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC 2016: 199-206 - [c31]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC 2016: 295-302 - [i12]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR abs/1602.00651 (2016) - [i11]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR abs/1602.00810 (2016) - 2015
- [j21]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. IEEE Trans. Inf. Theory 61(5): 2370-2387 (2015) - [i10]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. CoRR abs/1512.03503 (2015) - 2014
- [c30]Saruchi, Ivan Morel, Damien Stehlé, Gilles Villard:
LLL reducing with the most significant bits. ISSAC 2014: 367-374 - [i9]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations. CoRR abs/1402.0643 (2014) - 2013
- [c29]Jingwei Chen, Damien Stehlé, Gilles Villard:
A new view on HJLS and PSLQ: sums and projections of lattices. ISSAC 2013: 149-156 - 2012
- [j20]Xiao-Wen Chang, Damien Stehlé, Gilles Villard:
Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. Math. Comput. 81(279): 1487-1511 (2012) - 2011
- [j19]Gilles Villard:
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation. J. Symb. Comput. 46(7): 773-790 (2011) - [c28]Gilles Villard:
Recent progress in linear algebra and lattice basis reduction. ISSAC 2011: 3-4 - [c27]Andrew Novocin, Damien Stehlé, Gilles Villard:
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. STOC 2011: 403-412 - 2010
- [j18]Ivan Morel, Damien Stehlé, Gilles Villard:
Analyse numérique et réduction de réseaux. Tech. Sci. Informatiques 29(1): 115-144 (2010)
2000 – 2009
- 2009
- [j17]Claude-Pierre Jeannerod, Christophe Mouilleron, Gilles Villard:
Extending Cardinal's algorithm to a broader class of structured matrices. ACM Commun. Comput. Algebra 43(3/4): 84-85 (2009) - [c26]Claude-Pierre Jeannerod, Herve Knochel, Christophe Monat, Guillaume Revy, Gilles Villard:
A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor. IEEE Symposium on Computer Arithmetic 2009: 95-103 - [c25]Ivan Morel, Damien Stehlé, Gilles Villard:
H-LLL: using householder inside LLL. ISSAC 2009: 271-278 - 2008
- [j16]Ivan Morel, Damien Stehlé, Gilles Villard:
From an LLL-reduced basis to another. ACM Commun. Comput. Algebra 42(3): 142-143 (2008) - [i8]Gilles Villard:
Differentiation of Kaltofen's division-free determinant algorithm. CoRR abs/0804.1021 (2008) - [i7]Gilles Villard:
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation. CoRR abs/0810.5647 (2008) - 2007
- [c24]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster inversion and other black box matrix computations using efficient block projections. ISSAC 2007: 143-150 - [c23]Gilles Villard:
Certification of the QR factor R and of lattice basis reducedness. ISSAC 2007: 361-368 - [c22]Gilles Villard:
Some recent progress in exact linear algebra and related questions. ISSAC 2007: 391-392 - [i6]Gilles Villard:
Certification of the QR factor R, and of lattice basis reducedness. CoRR abs/cs/0701183 (2007) - [i5]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections. CoRR abs/cs/0701188 (2007) - 2006
- [j15]Bernhard Beckermann, George Labahn, Gilles Villard:
Normal forms for general polynomial matrices. J. Symb. Comput. 41(6): 708-737 (2006) - [c21]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving sparse rational linear systems. ISSAC 2006: 63-70 - [i4]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving Sparse Integer Linear Systems. CoRR abs/cs/0603082 (2006) - 2005
- [j14]Erich L. Kaltofen, Gilles Villard:
On the complexity of computing determinants. Comput. Complex. 13(3-4): 91-130 (2005) - [j13]Claude-Pierre Jeannerod, Gilles Villard:
Essentially optimal computation of the inverse of generic polynomial matrices. J. Complex. 21(1): 72-86 (2005) - [j12]Alain Darte, Robert Schreiber, Gilles Villard:
Lattice-Based Memory Allocation. IEEE Trans. Computers 54(10): 1242-1257 (2005) - [c20]Arne Storjohann, Gilles Villard:
Computing the rank and a small nullspace basis of a polynomial matrix. ISSAC 2005: 309-316 - [i3]Arne Storjohann, Gilles Villard:
Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix. CoRR abs/cs/0505030 (2005) - [i2]Claude-Pierre Jeannerod, Gilles Villard:
Asymptotically fast polynomial matrix algorithms for multivariable systems. CoRR abs/cs/0508113 (2005) - [i1]Clément Pernet, Aude Rondepierre, Gilles Villard:
Computing the Kalman form. CoRR abs/cs/0510014 (2005) - 2003
- [c19]Alain Darte, Robert Schreiber, Gilles Villard:
Lattice-based memory allocation. CASES 2003: 298-308 - [c18]Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard:
On the complexity of polynomial matrix computations. ISSAC 2003: 135-142 - 2002
- [j11]Gilles Villard:
Preface. J. Symb. Comput. 33(5): 519 (2002) - 2001
- [j10]Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
On Efficient Sparse Integer Matrix Smith Normal Form Computations. J. Symb. Comput. 32(1/2): 71-99 (2001) - [e1]Erich L. Kaltofen, Gilles Villard:
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. ACM 2001, ISBN 1-58113-417-7 [contents] - 2000
- [j9]Gilles Villard:
Processor Efficient Parallel Solution of Linear Systems of Equations. J. Algorithms 35(1): 122-126 (2000) - [c17]Wayne Eberly, Mark Giesbrecht, Gilles Villard:
Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685 - [c16]Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
Integer Smith form via the valence: experience with large sparse matrices from homology. ISSAC 2000: 95-105
1990 – 1999
- 1999
- [c15]Bernhard Beckermann, George Labahn, Gilles Villard:
Shifted Normal Forms of Polynomial Matrices. ISSAC 1999: 189-196 - 1998
- [j8]Gilles Villard:
Block solution of sparse linear systems over GF (q): the singular case. SIGSAM Bull. 32(4): 10-12 (1998) - [j7]René Aïd, Laurent Testard, Gilles Villard:
Global Error Visualization. J. Univers. Comput. Sci. 4(2): 90-98 (1998) - 1997
- [j6]Gilles Villard:
Fast Parallel Algorithms for Matrix Reduction to Normal Forms. Appl. Algebra Eng. Commun. Comput. 8(6): 511-537 (1997) - [c14]Gilles Villard:
Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract). ISSAC 1997: 32-39 - 1996
- [j5]Jean-Louis Roch, Gilles Villard:
Fast Parallel Computation of the Jordan Normal Form of Matrices. Parallel Process. Lett. 6(2): 203-212 (1996) - [j4]Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller, Gilles Villard:
Forword to the Special Issue on Real Numbers and Computers. Theor. Comput. Sci. 162(1): 1-3 (1996) - [c13]Gilles Villard:
Computing Popov and Hermite Forms of Polynomial Matrices. ISSAC 1996: 250-258 - 1995
- [j3]Gilles Villard:
Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices. J. Symb. Comput. 20(3): 269-286 (1995) - [c12]Thierry Gautier, Jean-Louis Roch, Gilles Villard:
Regular versus Irregular Problems and Algorithms. IRREGULAR 1995: 1-25 - [c11]M. P. Quéré, Gilles Villard:
An Algorithm for the Reduction of Linear DAE. ISSAC 1995: 223-231 - 1994
- [c10]Jean-Louis Roch, A. Vermeerbergen, Gilles Villard:
A New Load-Prediction Scheme Based on Algorithmic Cost Functions. CONPAR 1994: 878-889 - [c9]Gilles Villard:
Fast Parallel Computation of the Smith Normal Form of Polynomial Matrices. ISSAC 1994: 312-317 - [c8]Jean-Louis Roch, Gilles Villard:
Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices. PARLE 1994: 701-712 - 1993
- [c7]Gilles Villard:
Computation of the Smith Normal Form of Polynomial Matrices. ISSAC 1993: 209-217 - 1992
- [c6]Jean-Louis Roch, A. Vermeerbergen, Gilles Villard:
Cost Prediction for Load Balancing: Application to Algebraic Computations. CONPAR 1992: 467-478 - [c5]Jean-Louis Roch, Gilles Villard:
Parallel gcd and Lattice Basis Reduction. CONPAR 1992: 557-564 - [c4]Gilles Villard:
Parallel Lattice Basis Reduction. ISSAC 1992: 269-277 - 1991
- [c3]Françoise Roch-Siebert, Gilles Villard:
PAC: First Experiments on a 128 Transputers Méganode. ISSAC 1991: 343-351
1980 – 1989
- 1989
- [j2]Jean-Louis Roch, Pascale Sénéchaud, Françoise Siebert-Roch, Gilles Villard:
Computer algebra on MIMD machine. SIGSAM Bull. 23(1): 16-32 (1989) - [j1]Yves Robert, Bernard Tourancheau, Gilles Villard:
Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors. Inf. Process. Lett. 31(1): 21-29 (1989) - 1988
- [b1]Gilles Villard:
Calcul formel et parallélisme : résolution de systèmes linéaires. (Parallel algebraic computation. Solution of linear systems). Grenoble Institute of Technology, France, 1988 - [c2]Jean-Louis Roch, Pascale Sénéchaud, Françoise Roch-Siebert, Gilles Villard:
Computer Algebra on MIMD Machine. ISSAC 1988: 423-439 - 1987
- [c1]Michel Cosnard, Bernard Tourancheau, Gilles Villard:
Gaussian Elimination on Message Passing Architecture. ICS 1987: 611-628
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
