
- H-LLL: Using Householder Inside LLL NS Lyon, Universit de Lyon
- Certification of the QR Factor R and of Lattice Basis Reducedness
- http://www.elsevier.com/locate/jco Journal of Complexity 21 (2005) 7286
- comput. complex. 13 (2004), 91 130 1016-3328/04/03009140
- Some Recent Progress in Exact Linear Algebra and Related Questions
- ASYMPTOTICALLY FAST POLYNOMIAL MATRIX ALGORITHMS FOR MULTIVARIABLE SYSTEMS
- Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix
- Linear Algebra and its Applications 378 (2004) 99107 www.elsevier.com/locate/laa
- MATRIX RANK CERTIFICATION B. DAVID SAUNDERS, ARNE STORJOHANN, AND GILLES VILLARD
- doi:10.1006/jsco.2002.0548 Available online at http://www.idealibrary.com on
- ON THE COMPLEXITY OF COMPUTING DETERMINANTS* (Extended abstract)
- Shifted Normal Forms of Polynomial Matrices Bernhard Beckernmnu
- AAECC 8, 511--537 (1997) Fast Parallel Algorithms for Matrix Reduction
- Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems
- Computing Popov and Hermite Forms of Polynomial Matrices LMC-IMAG, 46, av. F. Viallet, F38031 Grenoble Cedex
- Fast parallel computation of the Smith normal form of polynomial matrices GILLES VILLARD
- Computation of the Smith normal form of polynomial matrices Gilles Villard
- PAC : First experiments on a 128 Transputers M6gmode Franqoise ROCH-SIEBERT1 and Gilles VILLARD 1
- Parallel Computer Algebra 1 JeanLouis Roch and Gilles Villard
- RAPPORT DE RECHERCHE A study of Coppersmith's block Wiedemann
- Lattice-Based Memory Allocation Alain Darte
- RAPPORT TECHNIQUE Some algorithms for
- Laboratoire de l'Informatique du Paralllisme cole Normale Suprieure de Lyon
- A new binary floating-point division algorithm and its software implementation on the ST231 processor
- Parallel Processing Letters World Scienti c Publishing Company
- Block solution of sparse linear systems over GF(q): the singular case LMCIMAG, B.P. 53 F38041 GRENOBLE cedex 9
- Computing the Frobenius Normal Form of a Sparse Matrix
- Regular versus irregular problems and algorithms.
- Journal of Symbolic Computation 46 (2011) 773790 Contents lists available at ScienceDirect
- Lattice-Based Memory Allocation Gilles Villard
- Z .Journal of Algorithms 35, 122 126 2000 doi:10.1006rjagm.1999.1069, available online at http:rrwww.idealibrary.com on
- RAPPORT TECHNIQUE Some algorithms for
- Analyse numrique et rduction de rseaux Ivan Morel* ,** --Damien Stehl*** --Gilles Villard**** ,**
- Linear Algebra and its Applications 343344 (2002) 119146 www.elsevier.com/locate/laa
- Journ ees AriNews { 30 mai 2000, ENS Lyon. Complexit e du Calcul du D eterminant
- Algorithms for Similarity Transforms Arne Storjohann Gilles Villard
- Memoire d'habilitation `a diriger des recherches Universite Claude Bernard Lyon I
- Workshop on Complexity --FoCM Minneapolis, Aug. 12, 2002
- Evaluation du signe et calcul du dterminant d'une matrice coe cients entiers
- Solving Sparse Rational Linear Systems Wayne Eberly1
- COMPUTER ALGEBRA ON MIMD MACHINE 1
- Laboratoire el lattice basis reduction
- Journal of Computational and Applied Mathematics 162 (2004) 133146 www.elsevier.com/locate/cam
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Laboratoire de l'Informatique du Paralllisme cole Normale Suprieure de Lyon
- Integer Smith Form via the Valence: Experience with Large Sparse Matrices from Homology 1
- Nuclear Instruments and Methods in Physics Research A 559 (2006) 207210 High precision numerical accuracy in physics research
- An algorithm for the reduction of linear DAE M.P. Qu6r6 G. Villard
- Computing the Rank of Large Sparse Matrices over Finite Jean-Guillaume Dumas 1 and Gilles Villard 2
- Exact computations on polynomial and integer
- doi:10.1006/jsco.2001.0451 Available online at http://www.idealibrary.com on
- Complexite de calculs sur les matrices enti`eres et polynomiales
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000000
- Parallel Computer Algebra1 Jean-Louis Roch and Gilles Villard
- ALA, 31 mai 2001 Rabat. Evaluation du Signe et
- Laboratoire de l'Informatique du Paralllisme cole Normale Suprieure de Lyon
- Lattice-Based Memory Allocation Alain Darte, Member, IEEE Computer Society, Robert Schreiber, and Gilles Villard