| 2008 |
|---|
| 41 | EE | Gilles Villard:
Differentiation of Kaltofen's division-free determinant algorithm
CoRR abs/0804.1021: (2008) |
| 2007 |
|---|
| 40 | EE | 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 |
| 39 | EE | Gilles Villard:
Certification of the QR factor R and of lattice basis reducedness.
ISSAC 2007: 361-368 |
| 38 | EE | Gilles Villard:
Some recent progress in exact linear algebra and related questions.
ISSAC 2007: 391-392 |
| 37 | EE | Gilles Villard:
Certification of the QR factor R, and of lattice basis reducedness
CoRR abs/cs/0701183: (2007) |
| 36 | EE | 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 |
|---|
| 35 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Solving sparse rational linear systems.
ISSAC 2006: 63-70 |
| 34 | EE | Wayne Eberly,
Mark Giesbrecht,
Pascal Giorgi,
Arne Storjohann,
Gilles Villard:
Solving Sparse Integer Linear Systems
CoRR abs/cs/0603082: (2006) |
| 33 | EE | Bernhard Beckermann,
George Labahn,
Gilles Villard:
Normal forms for general polynomial matrices.
J. Symb. Comput. 41(6): 708-737 (2006) |
| 2005 |
|---|
| 32 | EE | Arne Storjohann,
Gilles Villard:
Computing the rank and a small nullspace basis of a polynomial matrix.
ISSAC 2005: 309-316 |
| 31 | EE | Arne Storjohann,
Gilles Villard:
Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix
CoRR abs/cs/0505030: (2005) |
| 30 | EE | Claude-Pierre Jeannerod,
Gilles Villard:
Asymptotically fast polynomial matrix algorithms for multivariable systems
CoRR abs/cs/0508113: (2005) |
| 29 | EE | Clément Pernet,
Aude Rondepierre,
Gilles Villard:
Computing the Kalman form
CoRR abs/cs/0510014: (2005) |
| 28 | EE | Erich Kaltofen,
Gilles Villard:
On the complexity of computing determinants.
Computational Complexity 13(3-4): 91-130 (2005) |
| 27 | EE | Alain Darte,
Robert Schreiber,
Gilles Villard:
Lattice-Based Memory Allocation.
IEEE Trans. Computers 54(10): 1242-1257 (2005) |
| 26 | EE | Claude-Pierre Jeannerod,
Gilles Villard:
Essentially optimal computation of the inverse of generic polynomial matrices.
J. Complexity 21(1): 72-86 (2005) |
| 2003 |
|---|
| 25 | EE | Alain Darte,
Robert Schreiber,
Gilles Villard:
Lattice-based memory allocation.
CASES 2003: 298-308 |
| 24 | EE | Pascal Giorgi,
Claude-Pierre Jeannerod,
Gilles Villard:
On the complexity of polynomial matrix computations.
ISSAC 2003: 135-142 |
| 2002 |
|---|
| 23 | EE | Gilles Villard:
Preface.
J. Symb. Comput. 33(5): 519 (2002) |
| 2001 |
|---|
| 22 | | 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) |
| 2000 |
|---|
| 21 | | Wayne Eberly,
Mark Giesbrecht,
Gilles Villard:
Computing the Determinant and Smith Form of an Integer Matrix.
FOCS 2000: 675-685 |
| 20 | EE | 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 |
| 19 | | Gilles Villard:
Processor Efficient Parallel Solution of Linear Systems of Equations.
J. Algorithms 35(1): 122-126 (2000) |
| 1999 |
|---|
| 18 | EE | Bernhard Beckermann,
George Labahn,
Gilles Villard:
Shifted Normal Forms of Polynomial Matrices.
ISSAC 1999: 189-196 |
| 1998 |
|---|
| 17 | EE | R. Aïd,
L. Testard,
Gilles Villard:
Global Error Visualization.
J. UCS 4(2): 90-98 (1998) |
| 1997 |
|---|
| 16 | | Gilles Villard:
Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract).
ISSAC 1997: 32-39 |
| 15 | EE | Gilles Villard:
Fast Parallel Algorithms for Matrix Reduction to Normal Forms.
Appl. Algebra Eng. Commun. Comput. 8(6): 511-537 (1997) |
| 1996 |
|---|
| 14 | EE | Gilles Villard:
Computing Popov and Hermite Forms of Polynomial Matrices.
ISSAC 1996: 250-258 |
| 13 | | 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) |
| 1995 |
|---|
| 12 | | Thierry Gautier,
Jean-Louis Roch,
Gilles Villard:
Regular versus Irregular Problems and Algorithms.
IRREGULAR 1995: 1-25 |
| 11 | EE | M. P. Quéré,
Gilles Villard:
An Algorithm for the Reduction of Linear DAE.
ISSAC 1995: 223-231 |
| 10 | | Gilles Villard:
Generalized Subresultants for Computing the Smith Normal Form of Polynomial Matrices.
J. Symb. Comput. 20(3): 269-286 (1995) |
| 1994 |
|---|
| 9 | | Jean-Louis Roch,
A. Vermeerbergen,
Gilles Villard:
A New Load-Prediction Scheme Based on Algorithmic Cost Functions.
CONPAR 1994: 878-889 |
| 8 | EE | Gilles Villard:
Fast Parallel Computation of the Smith Normal Form of Polynomial Matrices.
ISSAC 1994: 312-317 |
| 7 | | Jean-Louis Roch,
Gilles Villard:
Parallel Computations with Algebraic Numbers - A Case Study: Jordan Normal Form of Matrices.
PARLE 1994: 701-712 |
| 1993 |
|---|
| 6 | EE | Gilles Villard:
Computation of the Smith Normal Form of Polynomial Matrices.
ISSAC 1993: 209-217 |
| 1992 |
|---|
| 5 | | Jean-Louis Roch,
A. Vermeerbergen,
Gilles Villard:
Cost Prediction for Load Balancing: Application to Algebraic Computations.
CONPAR 1992: 467-478 |
| 4 | | Jean-Louis Roch,
Gilles Villard:
Parallel gcd and Lattice Basis Reduction.
CONPAR 1992: 557-564 |
| 3 | EE | Gilles Villard:
Parallel Lattice Basis Reduction.
ISSAC 1992: 269-277 |
| 1991 |
|---|
| 2 | EE | Françoise Roch-Siebert,
Gilles Villard:
PAC: First Experiments on a 128 Transputers Méganode.
ISSAC 1991: 343-351 |
| 1988 |
|---|
| 1 | | Jean-Louis Roch,
Pascale Sénéchaud,
Françoise Roch-Siebert,
Gilles Villard:
Computer Algebra on MIMD Machine.
ISSAC 1988: 423-439 |
