| 2009 |
| 34 | EE | Alexandre Berzati,
Cécile Canovas,
Jean-Guillaume Dumas,
Louis Goubin:
Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable.
CT-RSA 2009: 414-428 |
| 33 | EE | Alexandre Berzati,
Cécile Canovas,
Jean-Guillaume Dumas,
Louis Goubin:
Fault Attacks on RSA Public Keys: Left-To-Right Implementations are also Vulnerable
CoRR abs/0901.0911: (2009) |
| 32 | EE | Jean-Guillaume Dumas,
Clément Pernet,
B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices
CoRR abs/0901.4747: (2009) |
| 31 | EE | Jean-Guillaume Dumas,
Dominique Duval,
Jean-Claude Reynaud:
Cartesian effect categories are Freyd-categories
CoRR abs/0903.3311: (2009) |
| 2008 |
| 30 | EE | Jean-Guillaume Dumas:
Q-adic transform revisited.
ISSAC 2008: 63-70 |
| 29 | EE | Jean-Guillaume Dumas,
Pascal Giorgi,
Clément Pernet:
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages.
ACM Trans. Math. Softw. 35(3): (2008) |
| 28 | EE | Jean-Guillaume Dumas,
Laurent Fousse,
Bruno Salvy:
Compressed Modular Matrix Multiplication
CoRR abs/0803.1975: (2008) |
| 27 | EE | Jean-Guillaume Dumas,
Laurent Fousse,
Bruno Salvy:
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
CoRR abs/0809.0063: (2008) |
| 2007 |
| 26 | EE | Jean-Guillaume Dumas,
Philippe Elbaz-Vincent,
Pascal Giorgi,
Anna Urbanska:
Parallel computation of the rank of large sparse matrices from algebraic K-theory.
PASCO 2007: 43-52 |
| 25 | EE | Jean-Guillaume Dumas,
Philippe Elbaz-Vincent,
Pascal Giorgi,
Anna Urbanska:
Parallel computation of the rank of large sparse matrices from algebraic K-theory
CoRR abs/0704.2351: (2007) |
| 24 | EE | Jean-Guillaume Dumas,
Dominique Duval,
Jean-Claude Reynaud:
Sequential products in effect categories
CoRR abs/0707.1432: (2007) |
| 23 | EE | Jean-Guillaume Dumas,
Clément Pernet,
Wei Zhou:
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
CoRR abs/0707.2347: (2007) |
| 22 | EE | Jean-Guillaume Dumas:
Q-adic Transform revisited
CoRR abs/0710.0510: (2007) |
| 2006 |
| 21 | EE | Jean-Guillaume Dumas,
Clément Pernet,
Jean-Louis Roch:
Adaptive Triangular System Solving.
Challenges in Symbolic Computation Software 2006 |
| 20 | | Jean-Guillaume Dumas,
Dominique Duval:
Vers une modélisation diagrammatique de la bibliothèque C++ d'algèbre linéaire LinBox.
LMO 2006: 117-134 |
| 19 | EE | Jean-Guillaume Dumas,
Thierry Gautier,
Pascal Giorgi,
Clément Pernet:
Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
CoRR abs/cs/0601133: (2006) |
| 18 | EE | Jean-Guillaume Dumas:
Bounds on the coefficients of the characteristic and minimal polynomials
CoRR abs/cs/0610136: (2006) |
| 17 | EE | Jacques Dubrois,
Jean-Guillaume Dumas:
Efficient polynomial time algorithms computing industrial-strength primitive roots.
Inf. Process. Lett. 97(2): 41-45 (2006) |
| 2005 |
| 16 | EE | Jean-Guillaume Dumas,
Clément Pernet,
Zhendong Wan:
Efficient computation of the characteristic polynomial.
ISSAC 2005: 140-147 |
| 15 | EE | Aude Rondepierre,
Jean-Guillaume Dumas:
Algorithms for symbolic/numeric control of affine dynamical systems.
ISSAC 2005: 277-284 |
| 14 | EE | Jean-Guillaume Dumas,
Clément Pernet,
Zhendong Wan:
Efficient Computation of the Characteristic Polynomial
CoRR abs/cs/0501074: (2005) |
| 13 | EE | Jean-Guillaume Dumas,
Dominique Duval:
Towards a diagrammatic modeling of the LinBox C++ linear algebra library
CoRR abs/cs/0510057: (2005) |
| 12 | EE | Jean-Guillaume Dumas,
Anna Urbanska:
An introspective algorithm for the integer determinant
CoRR abs/cs/0511066: (2005) |
| 11 | EE | Jean-Guillaume Dumas,
Aude Rondepierre:
Algorithms for Hybrid Optimal Control
CoRR abs/math/0502172: (2005) |
| 2004 |
| 10 | EE | Jean-Guillaume Dumas,
Pascal Giorgi,
Clément Pernet:
FFPACK: finite field linear algebra package.
ISSAC 2004: 119-126 |
| 9 | EE | Jean-Guillaume Dumas:
Efficient dot product over word-size finite fields
CoRR cs.SC/0404008: (2004) |
| 8 | EE | Jacques Dubrois,
Jean-Guillaume Dumas:
Efficient polynomial time algorithms computing industrial-strength primitive roots
CoRR cs.SC/0409029: (2004) |
| 2003 |
| 7 | | Jean-Guillaume Dumas,
Frank Heckenbach,
B. David Saunders,
Volkmar Welker:
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.
Algebra, Geometry, and Software Systems 2003: 177-206 |
| 6 | EE | Jean-Guillaume Dumas,
Aude Rondepierre:
Modeling the Electrical Activity of a Neuron by a Continuous and Piecewise Affine Hybrid System.
HSCC 2003: 156-171 |
| 2002 |
| 5 | EE | Jean-Guillaume Dumas,
Thierry Gautier,
Clément Pernet:
Finite field linear algebra subroutines.
ISSAC 2002: 63-74 |
| 4 | | Jean-Guillaume Dumas,
Jean-Louis Roch:
On parallel block algorithms for exact triangularizations.
Parallel Computing 28(11): 1531-1548 (2002) |
| 2001 |
| 3 | EE | Jean-Guillaume Dumas,
Jean-Louis Roch:
A parallel block algorithm for exact triangularization of rectangular matrices.
SPAA 2001: 324-325 |
| 2 | | 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 |
| 1 | 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 |