Integer Smith form via the valence: experience with large sparse matrices from homology. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (ISSAC, 2000)

Algorithmes parallèles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriques. (Efficient parallel algorithm for computer algebra : sparce linear algebra and algebraic extensions). - Jean-Guillaume Dumas (2000)

A parallel block algorithm for exact triangularization of rectangular matrices. - Jean-Guillaume Dumas; Jean-Louis Roch (SPAA, 2001)

On Efficient Sparse Integer Matrix Smith Normal Form Computations. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (J. Symb. Comput., 2001)

Finite field linear algebra subroutines. - Jean-Guillaume Dumas; Thierry Gautier; Clément Pernet (ISSAC, 2002)

On parallel block algorithms for exact triangularizations. - Jean-Guillaume Dumas; Jean-Louis Roch (Parallel Comput., 2002)

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. - Jean-Guillaume Dumas; Frank Heckenbach; B. David Saunders; Volkmar Welker (Algebra, Geometry, and Software Systems, 2003)

Modeling the Electrical Activity of a Neuron by a Continuous and Piecewise Affine Hybrid System. - Jean-Guillaume Dumas; Aude Rondepierre (HSCC, 2003)

FFPACK: finite field linear algebra package. - Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet (ISSAC, 2004)

Efficient dot product over word-size finite fields - Jean-Guillaume Dumas (CoRR, 2004)

Efficient computation of the characteristic polynomial. - Jean-Guillaume Dumas; Clément Pernet; Zhendong Wan (ISSAC, 2005)

Algorithms for symbolic/numeric control of affine dynamical systems. - Aude Rondepierre; Jean-Guillaume Dumas (ISSAC, 2005)

Towards a diagrammatic modeling of the LinBox C++ linear algebra library - Jean-Guillaume Dumas; Dominique Duval (CoRR, 2005)

An introspective algorithm for the integer determinant - Jean-Guillaume Dumas; Anna Urbanska (CoRR, 2005)

Algorithms for Hybrid Optimal Control - Jean-Guillaume Dumas; Aude Rondepierre (CoRR, 2005)

Adaptive Triangular System Solving. - Jean-Guillaume Dumas; Clément Pernet; Jean-Louis Roch (Challenges in Symbolic Computation Software, 2006)

Vers une modélisation diagrammatique de la bibliothèque C++ d'algèbre linéaire LinBox. - Jean-Guillaume Dumas; Dominique Duval (LMO, 2006)

Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages - Jean-Guillaume Dumas; Thierry Gautier; Pascal Giorgi; Clément Pernet (CoRR, 2006)

Bounds on the coefficients of the characteristic and minimal polynomials - Jean-Guillaume Dumas (CoRR, 2006)

Efficient polynomial time algorithms computing industrial-strength primitive roots. - Jacques Dubrois; Jean-Guillaume Dumas (Inf. Process. Lett., 2006)

Parallel computation of the rank of large sparse matrices from algebraic K-theory. - Jean-Guillaume Dumas; Philippe Elbaz-Vincent; Pascal Giorgi; Anna Urbanska (PASCO, 2007)

Sequential products in effect categories - Jean-Guillaume Dumas; Dominique Duval; Jean-Claude Reynaud (CoRR, 2007)

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm - Jean-Guillaume Dumas; Clément Pernet; Wei Zhou (CoRR, 2007)

Q-adic transform revisited. - Jean-Guillaume Dumas (ISSAC, 2008)

Compressed Modular Matrix Multiplication - Jean-Guillaume Dumas; Laurent Fousse; Bruno Salvy (CoRR, 2008)

Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages. - Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet (ACM Trans. Math. Softw., 2008)

Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable. - Alexandre Berzati; Cécile Canovas; Jean-Guillaume Dumas; Louis Goubin (CT-RSA, 2009)

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. - Brice Boyer; Jean-Guillaume Dumas; Clément Pernet; Wei Zhou (ISSAC, 2009)

On finding multiplicities of characteristic polynomial factors of black-box matrices. - Jean-Guillaume Dumas; Clément Pernet; B. David Saunders (ISSAC, 2009)

Contributions au calcul exact intensif. (Contributions to high-performance computer algebra). - Jean-Guillaume Dumas (2010)

Exact sparse matrix-vector multiplication on GPU's and multicore architectures. - Brice Boyer; Jean-Guillaume Dumas; Pascal Giorgi (PASCO, 2010)

Generic design of Chinese remaindering schemes. - Jean-Guillaume Dumas; Thierry Gautier; Jean-Louis Roch (PASCO, 2010)

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. - Jean-Guillaume Dumas; Thierry Gautier; Clément Pernet; B. David Saunders (ICMS, 2010)

States and exceptions are dual effects - Jean-Guillaume Dumas; Dominique Duval; Laurent Fousse; Jean-Claude Reynaud (CoRR, 2010)

Recursive double-size fixed precision arithmetic - Christophe Chabot; Jean-Guillaume Dumas; Laurent Fousse; Pascal Giorgi (CoRR, 2011)

Matrix Powers algorithm for trust evaluation in PKI architectures - Jean-Guillaume Dumas; Hicham Hossayni (CoRR, 2011)

Rank properties of subspaces of symmetric and hermitian matrices over finite fields. - Jean-Guillaume Dumas; Rod Gow; John Sheekey (Finite Fields Their Appl., 2011)

Cartesian effect categories are Freyd-categories. - Jean-Guillaume Dumas; Dominique Duval; Jean-Claude Reynaud (J. Symb. Comput., 2011)

Simultaneous modular reduction and Kronecker substitution for small finite fields. - Jean-Guillaume Dumas; Laurent Fousse; Bruno Salvy (J. Symb. Comput., 2011)

Matrix Powers Algorithms for Trust Evaluation in Public-Key Infrastructures. - Jean-Guillaume Dumas; Hicham Hossayni (STM, 2012)

Decorated proofs for computational effects: States - Jean-Guillaume Dumas; Dominique Duval; Laurent Fousse; Jean-Claude Reynaud (ACCAT, 2012)

Decorated proofs for computational effects: Exceptions - Jean-Guillaume Dumas; Dominique Duval; Laurent Fousse; Jean-Claude Reynaud (CoRR, 2012)

Computational linear algebra over finite fields - Jean-Guillaume Dumas; Clément Pernet (CoRR, 2012)

Adjunctions for exceptions - Jean-Guillaume Dumas; Dominique Duval; Laurent Fousse; Jean-Claude Reynaud (CoRR, 2012)

Attacking Privacy in a Fully Private Auction Protocol - Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001 (CoRR, 2012)

A duality between exceptions and states. - Jean-Guillaume Dumas; Dominique Duval; Laurent Fousse; Jean-Claude Reynaud (Math. Struct. Comput. Sci., 2012)

Computational linear algebra over finite fields. - Jean-Guillaume Dumas; Clément Pernet (Handbook of Finite Fields, 2013)

Brandt's Fully Private Auction Protocol Revisited. - Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001 (AFRICACRYPT, 2013)

Simultaneous computation of the row and column rank profiles. - Jean-Guillaume Dumas; Clément Pernet; Ziad Sultan (ISSAC, 2013)

Patterns for computational effects arising from a monad or a comonad. - Jean-Guillaume Dumas; Dominique Duval; Jean-Claude Reynaud (CoRR, 2013)

A decorated proof system for exceptions. - Jean-Guillaume Dumas; Dominique Duval; Jean-Claude Reynaud (CoRR, 2013)

Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source. - Grégory Nuel; Jean-Guillaume Dumas (Theor. Comput. Sci., 2013)

Parallel Computation of Echelon Forms. - Jean-Guillaume Dumas; Thierry Gautier; Clément Pernet; Ziad Sultan (Euro-Par, 2014)

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. - Brice Boyer; Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet; B. David Saunders (ICMS, 2014)

Essentially optimal interactive certificates in linear algebra. - Jean-Guillaume Dumas; Erich L. Kaltofen (ISSAC, 2014)

Formal verification in Coq of program properties involving the global state effect. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous (JFLA, 2014)

Certified Proofs in Programs Involving Exceptions. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Jean-Claude Reynaud (CICM Workshops, 2014)

Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula. - Brice Boyer; Jean-Guillaume Dumas (ACM Commun. Comput. Algebra, 2014)

Elements of Design for Containers and Solutions in the LinBox Library. - Brice Boyer; Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet; B. David Saunders (CoRR, 2014)

Program certification with computational effects. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous (CoRR, 2014)

Breaking a monad-comonad symmetry between computational effects. - Jean-Guillaume Dumas; Dominique Duval; Jean-Claude Reynaud (CoRR, 2014)

Generating S-Boxes from Semi-fields Pseudo-extensions. - Jean-Guillaume Dumas; Jean-Baptiste Orfila (CoRR, 2014)

On Newton-Raphson Iteration for Multiplicative Inverses Modulo Prime Powers. - Jean-Guillaume Dumas (IEEE Trans. Computers, 2014)

Computing the Rank Profile Matrix. - Jean-Guillaume Dumas; Clément Pernet; Ziad Sultan (ISSAC, 2015)

Relative Hilbert-Post Completeness for Exceptions. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous; Jean-Claude Reynaud (MACIS, 2015)

Hilbert-Post completeness for the state and the exception effects. - Jean-Guillaume Dumas; Dominique Duval; Burak Ekici; Damien Pous; Jean-Claude Reynaud (CoRR, 2015)

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices. - Jean-Guillaume Dumas; Erich L. Kaltofen; Emmanuel Thomé (CoRR, 2015)

Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. - Xavier Bultel; Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001 (FUN, 2016)

Recursive Double-Size Fixed Precision Arithmetic. - Alexis Breust; Christophe Chabot; Jean-Guillaume Dumas; Laurent Fousse; Pascal Giorgi (ICMS, 2016)

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. - Jean-Guillaume Dumas; Erich L. Kaltofen; Emmanuel Thomé; Gilles Villard (ISSAC, 2016)

Private Multi-party Matrix Multiplication and Trust Computations. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Jean-Baptiste Orfila; Maxime Puys (SECRYPT, 2016)

Fast Matrix Multiplication and Symbolic Computation. - Jean-Guillaume Dumas; Victor Y. Pan (CoRR, 2016)

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination. - Jean-Guillaume Dumas; Thierry Gautier; Clément Pernet; Jean-Louis Roch; Ziad Sultan (Parallel Comput., 2016)

Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas. - Brice Boyer; Jean-Guillaume Dumas (ACM Trans. Math. Softw., 2016)

Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication. - Jean-Guillaume Dumas; Vincent Zucca (ACISP (2), 2017)

LocalPKI: An Interoperable and IoT Friendly PKI. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Francis Melemedjian; Jean-Baptiste Orfila; Pascal Thoniel (ICETE (Selected Papers), 2017)

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. - Jean-Guillaume Dumas; Erich L. Kaltofen; Gilles Villard; Lihong Zhi (ISSAC, 2017)

Certificates for Triangular Equivalence and Rank Profiles. - Jean-Guillaume Dumas; David Lucas 001; Clément Pernet (ISSAC, 2017)

LOCALPKI: A User-Centric Formally Proven Alternative to PKIX. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Francis Melemedjian; Jean-Baptiste Orfila; Pascal Thoniel (SECRYPT, 2017)

Dual protocols for private multi-party matrix multiplication and trust computations. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Jean-Baptiste Orfila; Maxime Puys (Comput. Secur., 2017)

Fast computation of the rank profile matrix and the generalized Bruhat decomposition. - Jean-Guillaume Dumas; Clément Pernet; Ziad Sultan (J. Symb. Comput., 2017)

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk). - Jean-Guillaume Dumas (CASC, 2018)

A Cryptographer's Conspiracy Santa. - Xavier Bultel; Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001 (FUN, 2018)

Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix. - Jean-Guillaume Dumas; Clément Pernet (ISSAC, 2018)

Physical Zero-Knowledge Proof for Makaro. - Xavier Bultel; Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001; Daiki Miyahara; Takaaki Mizuki; Atsuki Nagao; Tatsuya Sasaki; Kazumasa Shinagawa; Hideaki Sone (SSS, 2018)

Proof-of-work certificates that can be efficiently computed in the cloud. - Jean-Guillaume Dumas (CoRR, 2018)

Poster: Proofs of Retrievability with Low Server Storage. - Michael Hanling; Gaspard Anthoine; Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (CCS, 2019)

Interactive Physical Zero-Knowledge Proof for Norinori. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Daiki Miyahara; Takaaki Mizuki; Tatsuya Sasaki; Hideaki Sone (COCOON, 2019)

LU Factorization with Errors. - Jean-Guillaume Dumas; Joris van der Hoeven; Clément Pernet; Daniel S. Roche (ISSAC, 2019)

Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm. - Jean-Guillaume Dumas; Pascal Lafourcade 001; Julio López Fenner; David Lucas 001; Jean-Baptiste Orfila; Clément Pernet; Maxime Puys (IWSEC, 2019)

On fast multiplication of a matrix by its transpose. - Jean-Guillaume Dumas; Clément Pernet; Alexandre Sedoglavic (ISSAC, 2020)

Elimination-based certificates for triangular equivalence and rank profiles. - Jean-Guillaume Dumas; Erich L. Kaltofen; David Lucas 001; Clément Pernet (J. Symb. Comput., 2020)

A faster cryptographer's Conspiracy Santa. - Xavier Bultel; Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001 (Theor. Comput. Sci., 2020)

Dynamic proofs of retrievability with low server storage. - Gaspard Anthoine; Jean-Guillaume Dumas; Mélanie de Jonghe; Aude Maignan; Clément Pernet; Michael Hanling; Daniel S. Roche (USENIX Security Symposium, 2021)

VESPo: Verified Evaluation of Secret Polynomials. - Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (CoRR, 2021)

Optimal threshold padlock systems. - Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001; Léo Robert (J. Comput. Secur., 2022)

The forking effect. - Florentina Soiman; Mathis Mourey; Jean-Guillaume Dumas; Sonia Jimenez-Garces (CoRR, 2023)

Fast in-place accumulated bilinear formulae. - Jean-Guillaume Dumas; Bruno Grenet (CoRR, 2023)

Some fast algorithms multiplying a matrix by its adjoint. - Jean-Guillaume Dumas; Clément Pernet; Alexandre Sedoglavic (J. Symb. Comput., 2023)

VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). - Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (Proc. Priv. Enhancing Technol., 2023)

In-place accumulation of fast multiplication formulae. - Jean-Guillaume Dumas; Bruno Grenet (ISSAC, 2024)

In-place fast polynomial modular remainder. - Jean-Guillaume Dumas; Bruno Grenet (ISSAC, 2024)

Strassen's algorithm is not optimally accurate. - Jean-Guillaume Dumas; Clément Pernet; Alexandre Sedoglavic (ISSAC, 2024)

Communication Optimal Unbalanced Private Set Union. - Jean-Guillaume Dumas; Alexis Galan; Bruno Grenet; Aude Maignan; Daniel S. Roche (CoRR, 2024)

Optimal Communication Unbalanced Private Set Union. - Jean-Guillaume Dumas; Alexis Galan; Bruno Grenet; Aude Maignan; Daniel S. Roche (ACNS (2), 2025)

A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications. - Jean-Guillaume Dumas; Clément Pernet; Alexandre Sedoglavic (CoRR, 2025)

Fast in-place accumulation. - Jean-Guillaume Dumas; Bruno Grenet (J. Symb. Comput., 2026)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication. - Jean-Guillaume Dumas; Clément Pernet; Alexandre Sedoglavic (J. Symb. Comput., 2026)