Gilles Villard Bibliography Linear algebra

List of publications - Gilles Villard

* V. Neiger, C. Pernet, G. Villard. Computing Krylov iterates in the time of matrix multiplication, 2024, pdf/arXiv:2402.07345 .

* G. Villard. Bivariate polynomial reduction and elimination ideal over finite fields, 2024, pdf/hal-04542799.

* V. Neiger, B. Salvy, É. Schost, G. Villard. Faster modular composition, Journal of the ACM, 71(2)-11, 2024, pdf/doi.

* G. Villard. Elimination ideal and bivariate resultant over finite fields. Proc. ISSAC'23, Tromsø, Norway, ACM Press, July 2023, pdf/doi.

* C. Pernet, H. Signargout, G. Villard. Exact computations with quasiseparable matrices. Proc. ISSAC'23, Tromsø, Norway, ACM Press, July 2023, pdf/doi.

* C. Pernet, H. Signargout, G. Villard. High-order lifting for polynomial Sylvester matrices, , Journal of Complexity, 2023, pdf/doi.

* G. Villard. Coppersmith's block Wiedemann method for polynomial problems. Applications of Computer Algebra - ACA 2021, Virtual Event, July 2021, pdf.

* P. Karpman, C. Pernet, H. Signargout, G. Villard. Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like Matrices. ISSAC'21, Virtual Event, Russian Federation, ACM Press, July 2021, pdf/doi.

* C.-P. Jeannerod, V. Neiger, G. Villard. Fast computation of approximant bases in canonical form. Journal of Symbolic Computation, 98:192-224, 2020, pdf/doi.

* G. Villard. On computing the resultant of generic bivariate polynomials. ISSAC'18, New York, USA, ACM Press, July 2018, pdf/doi, and maple worksheets.

* J. Chen, D. Stehlé, G. Villard. Computing an LLL-reduced basis of the orthogonal lattice. ISSAC'18, New York, USA, ACM Press, July 2018, pdf/doi.

* J.-G. Dumas, E.Kaltofen, G.Villard, L. Zhi. Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits. ISSAC'17, Kaiserslautern, Germany, ACM Press, July 2017, pdf/doi.

* C.-P. Jeannerod, V. Neiger, É. Schost, G. Villard. Computing minimal interpolation bases, J. of Symbolic Computation, 83:272-314, 2017, pdf/doi.

* J.-G. Dumas, E.Kaltofen, E. Thomé., G.Villard. Linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix. ISSAC'16, Waterloo, Canada, ACM Press, July 2016, pdf/doi.

* C.-P. Jeannerod, V. Neiger, É. Schost, G. Villard. Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. Proc. ISSAC'16, Waterloo, Canada, ACM Press, July 2016, pdf/doi.

* M. F. I. Chowdhury, C.-P. Jeannerod, V. Neiger, E. Schost, G. Villard. Faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations, IEEE Trans. Inf. Theory, 61(5):2370-2387, 2015, pdf/doi.

* Saruchi, I. Morel, D. Stehlé, G. Villard. LLL reducing with the most significant bits. Proc. ISSAC'14, Kobe, Japan, ACM Press, July 2014, pdf/doi.

* J. Chen, D. Stehlé, G. Villard. A new view on HJLS and PSLQ: sums and projections of lattices. Proc. ISSAC'13, Boston, USA, ACM Press, 149-156, June 2013, pdf/doi.

* G. Villard. Euclidean lattice basis reduction: algorithms and experiments for disclosing integer relations. International Linear Algebra Society Conference (ILAS), Providence, Rhode Island, USA, June 2013.

* X.-W. Chang, D. Stehlé, G. Villard. Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction, Mathematics of Computation, 81(279):1487-1511, 2012, pdf/doi.

* G. Villard. Some numerical considerations for lattice basis reduction. Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation, Waterloo, Ontario, Nov. 2011, invited.

* G. Villard. Recent progress in linear algebra and lattice basis reduction. ISSAC'11, San Jose, California, 2011, invited, pdf/doi.

* A. Novocin, D. Stehlé, G. Villard. An LLL-reduction algorithm with quasi-linear time complexity, Proc. ACM STOC, San Jose, California, June 2011, pdf/doi.

* I. Morel, D. Stehlé, G. Villard. Anayse numérique et réduction de réseaux, TSI, 29(1):115-144, 2010, pdf/doi.

* C.-P. Jeannerod, H. Knochel, C. Monat, G. Revy, G. Villard. A new binary floating-point division algorithm and its software implementation on the ST231 processor, Proc. ARITH'19, IEEE, Portland, USA, 95-103, June 2009, pdf/doi.

* I. Morel, D. Stehlé, G. Villard. H-LLL: Using Householder inside LLL. Proc. ISSAC'09, Seoul, Republic of Korea, ACM Press, 271-278, July 2009, pdf/doi.

* G. Villard. Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, J. of Symbolic Computation, 46:773-790, 2011, pdf/doi.

* G. Villard. Differentiation of Kaltofen's division-free determinant algorithm. Proc. MICA 2008, Trinidad and Tobago, 1-3 May 2008, pdf: ensl-00270753, arXiv:0804.1021v1.

* C.-P. Jeannerod, N. Louvet, N. Revol, and G. Villard. Computing condition numbers with automatic differentiation. Proc. 13th Gamm-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN), El Paso, USA, Oct. 2008.

* C.-P. Jeannerod, N. Louvet, N. Revol, and G. Villard. On the computation of some componentwise condition numbers. Proc. 4th International Conference on Symbolic and Numerical Scientific Computing (SNC), Hagenberg, Austria, July 2008.

* G. Villard. Some recent progress in symbolic linear algebra and related questions. Tutorial abstract, Proc. ISSAC'07, Waterloo, Canada, ACM Press, 391-392, August 2007, pdf/doi.

* G. Villard. Certification of the QR factor R, and of lattice basis reducedness. Proc. ISSAC'07, Waterloo, Canada, ACM Press, 361-368, August 2007, pdf/doi. Extended version: hal-00127059, arXiv cs.SC/0701183, 2007.

* W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard. Faster Inversion and other Black Box Matrix Computation Using Efficient Block Projections. Proc. ISSAC'07, Waterloo, Canada, ACM Press, 143-150, August 2007, pdf/doi.

* C.-P. Jeannerod and G. Villard. Asymptotically fast polynomial matrix algorithms for multivariable systems, Int. J. Control, 79(11):1359- 1367, 2006, pdf/doi.

* W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard. Solving sparse integer linear systems. Proc. ISSAC'06, Genova, Italy, ACM Press, 63-70, July 2006, pdf/doi.

* F. De Dinechin and G. Villard. High precision numerical accuracy for physics research. Nuclear Inst. and Methods in Physics Research A, 559(1):207-210, 2006, pdf/doi.

* B. Beckermann, G. Labahn, G. Villard. Normal forms for general polynomial matrices. Journal of Symbolic Computation, 41(6):708-737, 2006, pdf/doi.

* C. Pernet, A. Rondepierre and G. Villard. Computing the Kalman form. Research Report IMAG-ccsd-00009558, ArXiv cs.SC/0510014, October 2005.

* A. Storjohann, G. Villard. Computing the rank and a small nullspace basis of a polynomial matrix. Proc. ISSAC'05, Beijing, China, ACM Press, 309-316, Jul. 2005, pdf/doi. Extended version: RR LIP 2005-03, ENS Lyon, France, pdf.

* A. Darte, R. Schreiber, and G. Villard. Lattice-based memory allocation. IEEE Transactions on Computers, 54(10):1242-1257, 2005, pdf / doi.
Extended version: Research Report LIP 2004-23, April 2004, ENS Lyon, France, ps.

* C.P. Jeannerod and G. Villard. Essentially optimal computation of the inverse of generic polynomial matrices. Journal of Complexity, 21(1):72-86, 2005. Pdf / doi.

* E. Kaltofen and G. Villard. On the complexity of computing determinants. Computational Complexity, 13(3-4):91-130, 2005. Pdf / doi.

* J.-L. Beuchat, N. Sendrier, A. Tisserand, and G. Villard. FPGA Implementation of a Recently Published Signature Scheme. RR LIP 2004-14, March 2004, ENS Lyon, France. Pdf.

* P. Koiran, N. Portier and Gilles Villard. A rank theorem for Vandermonde matrices. Linear Algebra and its Applications, 378:99-107, 2004. Pdf.

* E. Kaltofen and G. Villard. Computing the sign or the value of the determinant of an integer matrix, a complexity survey. J. Comp. Applied Math., 162(1):133-146, 2004. Pdf.

* G. Villard. Lattice based memory allocation. Mathematics of Computer Algebra and Analysis, Mocaa, May 6-7th 2004, U. Waterloo, Ontario, Canada, slides.

* B. David Saunders, Arne Storjohann and Gilles Villard. Matrix Rank Certification. Elect. J. Linear Algebra, 11:16-23, 2004. Pdf.

* A. Darte, R. Schreiber and G. Villard. Lattice-based memory allocation. International Conference on Compilers, Architecture and Synthesis for Embedded Systems, San Jose, California, USA, 135-142, ACM Press, Nov. 2003. Pdf.

* G. Villard (invited speaker). Exact computations on polynomial and integer matrices. SIAM Conference on Applied Linear Algebra LA03, Williamsburg VA USA, July 15-19, 2003. Abstract.pdf.

* G. Villard. Algorithmique en algèbre linéaire exacte. Mémoire d'habilitation à diriger des recherches, Université Claude Bernard Lyon 1, mars 2003. Pdf.

* P. Giorgi, C.P. Jeannerod and G. Villard. On the complexity of polynomial matrix computations. International Symposium on Symbolic and Algebraic Computation, Philadelphia, Pennsylvania USA, aug. 2003, 135-142, ACM Press. Pdf.

* J.G. Dumas and G. Villard. Computing the rank of large sparse matrices over finite fields. Proc. CASC'2002, The Fifth International Workshop on Computer Algebra in Scientific Computing, Big Yalta, Crimea, Ukraine, 22-27 sept. 2002, Springer-Verlag. Postscript.

* J.G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B.D. Saunders, W.J. Turner and G. Villard. LinBox: A Generic Library for Exact Linear Algebra. Proc. ICMS'2002 : International Congress of Mathematical Software, Beijing, China, pages 40-50, World Scientific, Singapore, 2002. Pdf.

* G. Villard Editor, Special Issue "International Symposium on Algebraic and Symbolic Computation", Journal of Symbolic Computation, 33(5):519-520, 2002. Preface.pdf

* M. Giesbrecht, A. Storjohann and G. Villard. Algorithms for matrix canonical forms. In Computer Algebra Handbook. J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors. Springer Verlag, Heidelberg, Germany, 2002.

* L. Chen, W. Eberly, E. Kaltofen, B.D. Saunders, W.J. Turner and G. Villard. Efficient matrix preconditioners for black box linear algebra. Linear Algebra and its Applications, 343-344:119-146, 2002. Pdf.

* E. Kaltofen and G. Villard. On the complexity of computing determinants. In Kiyoshi Shirayanagi and Kazuhiro Yokoyama, editors, Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001), volume 9 of Lecture Notes Series on Computing, pages 13-27, Singapore, 2001. World Scientific. Invited contribution (Kaltofen); extended abstract. Pdf - Maple 6 worksheet: Mws.

* J.G. Dumas, B.D. Saunders and G. Villard. On efficient sparse integer matrix Smith normal form computations. Journal of Symbolic Computation, Special Issue on Computer Algebra and Mechanized Reasoning, 32(1-2):71-99, 2001. Pdf.

* L. Gerbaud, M. Barkatou, G. Villard and A. Bolopion. Résolution symbolique d'équations différentielles ordinaires en vue de l'étude de circuits d'électronique de puissance. Revue Internationale de Génie Electrique 4(1-2):105-120, 2001.

* G. Villard. Evaluation du signe et calcul du déterminant d'une matrice à coefficients entiers. Intervention à Algèbre Linéaire et Arithmétique, Rabat, Maroc, Mai 2001. Transparents.ps, Texte préliminaire.ps.

* G. Villard. Computing the Frobenius normal form of a sparse matrix. The Third International Workshop on Computer Algebra in Scientific Computing, Samarkand, Uzbekistan, oct. 2000, Springer-Verlag, 395-407. Pdf.

* W. Eberly, M. Giesbrecht and G. Villard. Computing the determinant and Smith form of an integer matrix. The 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, nov. 2000. Pdf.

* J.G. Dumas, B.D. Saunders and G. Villard. Integer Smith form via the valence: experience with large sparse matrices from homology. International Symposium on Symbolic and Algebraic Computation, St Andrews, Scotland, aug. 2000, ACM Press. Pdf.

* M. Giesbrecht, W. Eberly and G. Villard. Fast computations of integer determinants. The 6th International IMACS Conference on Applications of Computer Algebra, St. Petersburg, Russia, june 2000.

* A. Storjohann and G. Villard. Algorithms for similarity transforms. The Seventh Rhine Workshop on Computer Algebra, Bregenz, Austria, March 2000. Postscript.

* G. Villard. Processor efficient parallel solution of linear systems of equations. Journal of Algorithms 35:122-126 (2000). Pdf.

* L. Gerbaud, M. Barkatou, G. Villard and A. Bolopion. Résolution symbolique d'équations différentielles ordinaires par la décomposition de Dunford en vue de l'étude de circuits d'électronique de puissance. Third European Conference on Numerical Methods in Electromagnetism, Poitiers, France, march 2000.

* B. Beckermann, G. Labahn and G. Villard. Shifted Normal Forms of Polynomial Matrices. In International Symposium on Symbolic and Algebraic Computation, Vancouver, Canada , pp 189-196. ACM Press, July 1999. Pdf.

* G. Villard. Block solution of sparse linear systems over GF(q): the singular case. Sigsam Bulletin 32 (4): 10-12, 1999. Postscript.

* R. Aïd, L. Testard and G. Villard. Global error visualization. Journal of Universal Computer Science 4 (2) : 90-98, 1998. Postscript.

* J.G. Dumas, T. Gautier, J.L. Roch and G. Villard. Data-flow multithreaded parallelism in computer algebra algorithms The 4th International IMACS Conference on Applications of Computer Algebra, Prague, Czech Republic, august 1998.

* G. Villard. A study of Coppersmith's block Wiedemann algorithm using matrix polynomials. RR 975-I-M IMAG Grenoble France, April 1997. Pdf.

* G. Villard. Fast parallel algorithms for matrix reduction to normal forms. Appli. Alg. Eng., Comm. Comp., 8 (6): 511-538, 1997. Pdf.

* G. Villard. Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. In International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, USA. ACM Press, July 1997. Pdf.

* J.L. Roch and G. Villard. Parallel computer algebra, a survey, ISSAC'97 tutorial, July 1997, IMAG Grenoble France, pdf.

* R. Aïd, L. Testard and G. Villard. Global error visualization. In GAMM/IMACS International Symposium SCAN'97, Lyon, France, sept. 97.

* J.L. Roch and G. Villard. Fast parallel computation of the Jordan normal form of matrices. Parallel Processing Letters, 6(2):203--212, 1996. Pdf.

* G. Villard. Computing Popov and Hermite forms of polynomial matrices. In International Symposium on Symbolic and Algebraic Computation, Zurich, Suisse . ACM Press, July 1996, 250 - 258. Pdf.

* Parallélisme et applications irrégulières. Hermès 1995. G. Authié, J.M. Garcia, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, B. Virot. Détail.

* T. Gautier, J.L. Roch, and G. Villard. Regular versus irregular problems and algorithms. In Proc. of IRREGULAR'95, Lyon, France , LNCS 980. Springer-Verlag, Sep. 1995. Pdf.

* M.P. Quéré and G. Villard. An algorithm for the reduction of linear DAE. In International Symposium on Symbolic and Algebraic Computation, Montreal, Canada , 223-231, ACM Press, July 1995. Pdf.

* G. Villard. Generalized subresultants for computing the Smith normal form of polynomial matrices. Journal of Symbolic Computation , 20:269-286, 1995. Pdf.

* G. Villard. Computer algebra methods for solving ODE. In SciCADE'95, Stanford University, CA, march 1995.

* Algorithmes parallèles, analyse et conception. Hermès 1994. G. Authié, J.M. Garcia, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, B. Virot. Détail.

* J.L. Roch, A. Vermeerbergen, and G. Villard. A new load-prediction scheme based on algorithmic cost functions. In CONPAR 94, Linz Austria , LNCS 854, Sep. 1994.

* J.L. Roch and G. Villard. Parallel computations with algebraic numbers, a case study: Jordan normal form of matrices. In Parallel Architectures and Languages Europe 94, Athens Greece , LNCS 817, July 1994.

* G. Villard. Fast parallel computation of the Smith normal form of polynomial matrices. In International Symposium on Symbolic and Algebraic Computation, Oxford, UK , 312 - 317. ACM Press, July 1994. Pdf.

* G. Villard. Computation of the Smith normal form of polynomial matrices. In International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine . ACM Press, p 209-217, July 1993. Pdf.

* J.L. Roch, A. Vermeerbergen, and G. Villard. Cost prediction for load-balancing: application to algebraic computations. In CONPAR 92, Lyon, France , LNCS 634, September 1992. Pdf.

* J.L. Roch and G. Villard. Parallel gcd and lattice basis reduction. In CONPAR 92, Lyon France , LNCS 634, September 1992.

* G. Villard. Parallel lattice basis reduction. In International Symposium on Symbolic and Algebraic Computation, Berkeley California USA . ACM Press, July 1992. Pdf.

* F. Siebert and G. Villard. PAC : First experiments on a 128 transputers Meganode. In International Symposium on Symbolic and Algebraic Computation, Bonn Germany . ACM Press, 1991. Pdf.

* P. Michallon, D. Trystram, and G. Villard. Broadcasting on 2d-torus. Parallel Computing 91, London, UK , 1991.

* J.Y. Blanc, D. Trystram, and G. Villard. Implementing advanced communication schemes on distributed-memory architectures. In The Fifth Distributed Memory Computing Conference, Univ. of South Carolina, Columbia , 1990.

* Y. Robert, B. Tourancheau, and G. Villard. Algorithmes de Gauss et de Jordan sur un anneau de processeurs. CRAS Paris , t.309, série I, 403-406, 1989.

* Y. Robert, B. Tourancheau, and G. Villard. Data allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors. Information Processing Letters , 31, 1989.

* J.L. Roch, F. Siebert, P. Sénéchaud, and G. Villard. Computer Algebra on a MIMD machine. In ISSAC'88, LNCS 358 and in SIGSAM Bulletin, ACM , 23/11, p 16-32, 1989. Pdf.

* M. Cosnard, , B. Tourancheau, and G. Villard. Gaussian elimination on message passing architectures. In Supercomputing, E.N. Houtis et al. eds , LNCS 297, 1988.

* G. Villard. Parallel general solution of rational linear systems using p-adic expansions. In IFIP WG 10.3 Working Conference on Parallel Processing, Pisa Italy , 1988.

* G. Villard. Calcul Formel et Parallélisme : Résolution de Systèmes Linéaires. Thèse de Doctorat, Institut National Polytechnique de Grenoble, France, Décembre 1988. Pdf.

* J.L. Roch, F. Siebert, P. Sénéchaud, and G. Villard. Calcul Formel, Parallélisme et Occam. In 7ht Occam Users Group, Eds T. Muntean, 1987.

J.C. Bajard, C. Frougny, J.M. Muller and G. Villard Editors, Special issue "Real Numbers and computers", Theoretical Computer Science, Volume 162, No 1, Aug. 1996.

Autres

M. Doreille, T. Gautier, and G. Villard. Parallel programming and dynamic load-balancing for computer algebra. In Symposium on parallel computing for solving large scale and irregular applications, Sophia-Antipolis, France. INRIA, July 1996.

G. Villard. Some algorithms for matrix polynomials. Technical Report RT157, IMAG Grenoble France, 1996. Part 1, postcript. Part 2, postcript.

T. Gautier, J.L. Roch, and G. Villard. PAC++ v2.0: user and developer guide. Technical Report APACHE 14, IMAG Grenoble France, 1994.

M.P. Quéré and G. Villard. Une forme normale pour les DAE linéaires. Technical Report RT122, IMAG Grenoble France, 1994.

Manuel du Méganode. Technical Report RT 98, IMAG Grenoble F, 1993. Y. Arrouye, J.P. Kitajima, J. Prévost, J.L. Roch, C. Tron, et G. Villard.

Projet APACHE, 1993. 5ième Rencontres sur le Parallélisme, Brest, 25-28 mai. J. Briat, J. Chassin de Kergommeaux, B. Plateau, J.L. Roch, D. Trystram, G. Villard, et J.M. Vincent.

I. Gil and G. Villard. Formes normales de matrices. Technical Report RT 91, IMAG Grenoble F, 1992.

P. Michallon, D. Trystram, and G. Villard. Optimal broadcasting on torus. Technical Report RR 872 I, IMAG Grenoble F, 1992.

J.L. Roch and G. Villard. PAC : Calcul Formel et Parallélisme, recherches en cours et perspectives. Technical Report RR 876 M, IMAG Grenoble F, 1992.

G. Villard. Parallel algebraic computations on MIMD computers. In conférencier invité, IV Symposium Franco-Japonais ICOT-INRIA, Rennes, 1991.

M. Cosnard, B. Tourancheau, and G. Villard. Présentation de l'hypercube FPS T20 , 1987. Journées Architecture C3, Bigre+Globule 56.

M. Cosnard and G. Villard. Preliminary experimental results on the hypercube FPS T20 at TIM3 laboratory, 1987. Workshop on Massively Parallel Systems, Napoly I.

P. Sénéchaud, F. Siebert, and G. Villard. Scraptchpad II : présentation d'un nouveau langage de Calcul Formel. Technical Report RR640M, IMAG Grenoble F, 1987.

Quelques exposés (liste non à jour)

.. Lattice based memory allocation, G. Villard Invited speaker, Mathematics of Computer Algebra and Analysis, Mocaa, May 6-7th 2004, University of Waterloo, Ontario, Canada (06/05/04). Slides.

.. Algorithms in exact linear algebra, Math. Dpt., North Carolina State University, Raleigh NC USA (02/04/03).

.. Complexité de calculs sur les matrices entières et polynomiales, Journées Nationales de Calcul Formel, Luminy, Marseille (24/01/03). Transparents

.. Exact computation of the determinant and of the inverse of a matrix, Workshop on Complexity, Foundations of Computational Mathematics FoCM'02, Minneapolis (12/08/02). Slides

.. Calcul exact du déterminant et de l'inverse d'une matrice, Séminaire du projet Algorithmes, INRIA Rocquencourt (27/05/02).

.. Exact computations with sparse matrices, Lecture, Math. Dpt., North Carolina State University, Raleigh NC USA (12/03/00).

.. Calcul du déterminant de matrices, Groupe de travail IGD-LIP complexité algébrique (26/10/00). Transparents.

.. Complexité du calcul du déterminant d'une matrice entière, Journées Arinews, ENS Lyon (30/05/00).

.. Computer Algebra for Differential Algebraic Equations, Invited talk, Southern Ontario Numerical Analysis Day 2000, The University of Western Ontario in London, Ontario, Canada (12/05/00).

.. Calcul de la forme normale de Frobenius d'une matrice creuse, Séminaire du laboratoire ANO, Lille (27/04/00).

.. Pré-conditionnement aléatoire et algorithmes probabilistes en algèbre linéaire de boîtes noires, Séminaire du LIP, ENS Lyon (29/03/00) - Transparents.

.. Conditionnement algébrique et algorithmes probabilistes en algèbre linéaire formelle, Ecole Franco-Marocaine d'analyse numérique et de calcul symbolique, Rabat (17/09/99).

.. Shifted normal forms of polynomials matrices, (jointly with B. Beckermann and G. Labahn), Algebra Seminar, Math. Dpt., North Carolina State University, Raleigh NC USA (28/04/99).

.. Conditionnement (algébrique) et algorithmes probabilistes pour les grandes matrices creuses en calcul formel, Journées d'algèbre linéaire appliquée, Laboratoire AAO, Université de Dijon (02/04/99).

.. Algorithmes probabilistes pour les systèmes linéaires, Colloquium du LACO, Université de Limoges (03/12/97).

.. Exposé introductif sur l'algèbre linéaire parallèle en calcul formel, Journées TIPE, Grenoble (09/09/97).

.. Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, ISSAC'97, Maui - Hawaii, USA (16/07/97).

.. Computer algebra and parallelism, ISSAC'97 Tutorial, Maui - Hawaii, USA (15/07/97).

.. Acte, Applications et Calcul Formel : équations algébro-différentielles, Université de Dijon (21/05/97).

.. About Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, Symbolic Computation Group, University of Waterloo Ontario Canada (04/02/97).

.. Matrices polynomiales pour la résolution de Ax=0 sur GF(2), Séminaire de Calcul Formel, LMC - IMAG, Grenoble (09/01/97).