Gilles Villard
Orcid: 0000-0003-1936-7155Affiliations:
- ENS Lyon, France
According to our database1,
Gilles Villard
authored at least 68 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
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.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
2020
2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
2017
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017
2016
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.
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.
IEEE Trans. Inf. Theory, 2015
2014
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014
2013
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.
Math. Comput., 2012
2011
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation.
J. Symb. Comput., 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
2010
2009
ACM Commun. Comput. Algebra, 2009
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.
Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009
2008
2007
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007
Faster inversion and other black box matrix computations using efficient block projections.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007
2006
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
2005
J. Complex., 2005
CoRR, 2005
Proceedings of the Symbolic and Algebraic Computation, 2005
2003
Proceedings of the Symbolic and Algebraic Computation, 2003
2002
2001
J. Symb. Comput., 2001
2000
J. Algorithms, 2000
Integer Smith form via the valence: experience with large sparse matrices from homology.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1999
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999
1998
SIGSAM Bull., 1998
1997
Appl. Algebra Eng. Commun. Comput., 1997
Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract).
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997
1996
Forword to the Special Issue on Real Numbers and Computers.
Theor. Comput. Sci., 1996
Parallel Process. Lett., 1996
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996
1995
Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices.
J. Symb. Comput., 1995
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995
1994
Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994
Proceedings of the Parallel Processing: CONPAR 94, 1994
1993
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993
1992
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992
Proceedings of the Parallel Processing: CONPAR 92, 1992
Proceedings of the Parallel Processing: CONPAR 92, 1992
1991
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.
Inf. Process. Lett., 1989
1988
Calcul formel et parallélisme : résolution de systèmes linéaires. (Parallel algebraic computation. Solution of linear systems).
PhD thesis, 1988
1987
Proceedings of the Supercomputing, 1987