HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation


...
ensl-00270753v1  Journal articles
Gilles Villard. Differentiation of Kaltofen's division-free determinant algorithm
Journal of Symbolic Computation, Elsevier, 2011, 46 (7), pp.773-790. ⟨10.1016/j.jsc.2010.08.012⟩
...
hal-02101893v1  Reports
Lin ChenW. EberlyErich KaltofenB.D. SaundersW.J. Turner et al.  Efficient Matrix Preconditioners for Black Box Linear Algebra
[Research Report] LIP RR-2001-05, Laboratoire de l'informatique du parallélisme. 2001, 2+18p
...
hal-02101912v1  Reports
Alain DarteRob SchreiberGilles Villard. Lattice-Based Memory Allocation
[Research Report] LIP RR-2004-23, Laboratoire de l'informatique du parallélisme. 2004, 2+43p
...
hal-02102206v1  Reports
Claude-Pierre JeannerodGilles Villard. Asymptotically fast polynomial matrix algorithms for multivariable systems
[Research Report] LIP RR-2005-36, Laboratoire de l'informatique du parallélisme. 2005, 2+12p
...
hal-02102099v1  Reports
Erich KaltofenGilles Villard. On the complexity of computing determinants
[Research Report] LIP RR-2003-36, Laboratoire de l'informatique du parallélisme. 2003, 2+35p
...
hal-02101933v1  Reports
Bernd BeckermannGeorge LabahnGilles Villard. Normal Forms for General Polynomial Matrices
[Research Report] LIP RR-2002-1, Laboratoire de l'informatique du parallélisme. 2002, 2+31p
...
hal-02102007v1  Reports
David SaundersArne StorjohannGilles Villard. Matrix Rank Certification
[Research Report] LIP RR-2001-30, Laboratoire de l'informatique du parallélisme. 2001, 2+6p
...
hal-02101878v1  Reports
Pascal GiorgiClaude-Pierre JeannerodGilles Villard. On the Complexity of Polynomial Matrix Computations
[Research Report] LIP RR-2003-2, Laboratoire de l'informatique du parallélisme. 2003, 2+15p
...
hal-02101902v1  Reports
Arne StorjohannGilles Villard. Computing the rank and a small nullspace basis of a polynomial matrix
[Research Report] LIP RR-2005-3, Laboratoire de l'informatique du parallélisme. 2005, 2+24p
...
hal-02101855v1  Reports
Erich KaltofenGilles Villard. Computing the sign or the value of the determinant of an integrer matrix, a complexity survey
[Research Report] LIP RR-2002-2, Laboratoire de l'informatique du parallélisme. 2002, 2+14p
...
hal-02101970v1  Reports
Claude-Pierre JeannerodGilles Villard. Straight-line computation of the polynomial matrix inverse
[Research Report] LIP RR-2002-47, Laboratoire de l'informatique du parallélisme. 2002, 2+10p
...
hal-02102080v1  Reports
Jean-Guillaume DumasT. GautierM. GiesbrechtPascal GiorgiB. Hovinen et al.  LinBox: A Generic Library for Exact Linear Algebra
[Research Report] LIp RR-2002-15, Laboratoire de l'informatique du parallélisme. 2002, 2+12p
...
hal-02068056v1  Conference papers
Jean-Guillaume DumasGilles Villard. Computing the Rank of Large Sparse Matrices over Finite Fields
Computer Algebra in Scientific Computing (CASC) 2002, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov, Sep 2002, Yalta, Ukraine. pp.47--62
hal-02018851v1  Conference papers
Jean-Guillaume DumasB. David SaundersGilles Villard. Integer Smith form via the valence
International Symposium on Symbolic and Algebraic Computation (ISSAC'00), 2000, St. Andrews, United Kingdom. pp.95-105, ⟨10.1145/345542.345590⟩
...
ensl-00327678v2  Journal articles
Ivan MorelDamien StehléGilles Villard. Analyse numérique et réduction de réseaux
Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2010, 29 (1), pp.115-144. ⟨10.3166/tsi.29.115-144⟩
hal-00550979v1  Conference papers
Ivan MorelDamien StehléGilles Villard. H-LLL: Using Householder inside LLL
ISSAC 2009, 2009, South Korea. pp.271-278
hal-00857021v1  Journal articles
Yves RobertBernard TourancheauGilles Villard. Algorithmes de Gauss et de Jordan sur un anneau de processeurs
Comptes rendus de l'Académie des sciences. Série I, Mathématique, Elsevier, 1989, 309, pp.403-406
...
ensl-00534899v2  Conference papers
Andrew NovocinDamien StehléGilles Villard. An LLL-reduction algorithm with quasi-linear time complexity
STOC'11 - 43rd annual ACM symposium on Theory of computing, 2011, San Jose, United States. pp.403-412, ⟨10.1145/1993636.1993691⟩
hal-00746228v1  Journal articles
Claude-Pierre JeannerodChristophe MouilleronGilles Villard. Extending Cardinal's algorithm to a broader class of structured matrices
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2009, 43 (3/4), pp.84-85. ⟨10.1145/1823931.1823941⟩
...
hal-00644796v1  Conference papers
Gilles Villard. Recent progress in linear algebra and lattice basis reduction (invited)
ISSAC'11 - International symposium on Symbolic and algebraic computation, 2011, San Jose, United States. pp.3-4, ⟨10.1145/1993886.1993889⟩