-
-
| Publications | Co-authors | Editorial activities | Talks | Popularization |
| Computer algebra: | [107] [103] [102] [100] [97] [89] [88] [85] [83] [81] [73] [68] [67] [62] [57] [56] [50] [49] [47] [33] [32] [29] [27] [26] [18] [15] [14] [13] [12] [11] [10] [9] [7] [5] [3] |
| Security, Arithmetic, cryptology, coding theory, blockchains: | [105] [104] [98] [96] [95] [94] [93] [92] [91] [90] [87] [86] [86] [84] [83] [82] [80] [79] [78] [77] [76] [75] [74] [72] [71] [70] [65] [64] [63] [61] [59] [58] [54] [48] [46] [44] [42] [41] [39] [38] [31] [30] [28] [25] [23] [22] [21] [20] |
| Parallel algorithms, models of computation, software engineering: | [106] [101] [99] [69] [66] [60] [55] [53] [52] [51] [45] [43] [40] [37] [36] [35] [34] [24] [19] [17] [16] [8] [6] [4] [2] [1] |
 2026 | |
||||||||
| [ 107 ]
|
Fast in-place accumulation.
(C++ PLinOpt library).
Jean-Guillaume Dumas
et
Bruno Grenet.
Journal of Symbolic Computation. Volume 134, number 102523, Mai-Juin 2026. |
||||||||
| [ 106 ]
|
Towards automated generation of fast and accurate algorithms for recursive matrix multiplication.
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
Journal of Symbolic Computation. Volume 134, number 102524, Mai-Juin 2026. |
||||||||
| [ 105 ]
|
The forking effect.
Jean-Guillaume Dumas,
Sonia
Jimenez Garces,
Mathis Mourey
et
Florentina Şoiman.
Quarterly Review of Economics and Finance, 105(102090), Janvier 2026. |
||||||||
| 2025 | |
||||||||
| [ 104 ]
|
Communication Optimal Unbalanced Private Set Union.
(C++ CoUPSU library).
Jean-Guillaume Dumas,
Alexis Galan,
Bruno Grenet,
Aude Maignan,
et
Daniel S. Roche.
ACNS 2025: 23rd International Conference on Applied Cryptography and Network Security, pages 107--135, Munich, Germany, 23--26 Juin 2025. |
||||||||
| [ 103 ]
|
A non-commutative
algorithm for multiplying 4×4 matrices using 48 non-complex multiplications.
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
Rapport de Recherche IMAG-hal-05112145. arXiv: cs.SC/2506.13242 Juin 2025. |
||||||||
| [ 102 ]
|
A non-commutative
algorithm for multiplying a 3×4 matrix by a 4×7
matrix using 63 non-complex multiplications.
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
Rapport de Recherche IMAG-hal-05121550. Juin 2025. |
||||||||
| 2024 | |
||||||||
| [ 101 ]
|
In-place accumulation of fast multiplication formulae
(C++ PLinOpt library).
Jean-Guillaume Dumas
et
Bruno Grenet.
ISSAC 2024 : ACM International Symposium on Symbolic and Algebraic Computations, pages 16--25, Raleigh, NC USA, 16--19 Juillet 2024. |
||||||||
| [ 100 ]
|
In-place fast polynomial modular remainder
(C++ PLinOpt library).
Jean-Guillaume Dumas
et
Bruno Grenet.
ISSAC 2024 : ACM International Symposium on Symbolic and Algebraic Computations, pages 26--35, Raleigh, NC USA, 16--19 Juillet 2024. |
||||||||
| [ 99 ]
|
Strassen's algorithm is not optimally accurate
(Matlab Fast-Matrix-Multiplication benchmarks).
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
ISSAC 2024 : ACM International Symposium on Symbolic and Algebraic Computations, pages 254-–263, Raleigh, NC USA, 16--19 Juillet 2024. |
||||||||
| 2023 | |
||||||||
| [ 98 ]
|
VESPo: Verified Evaluation of Secret Polynomials (C++ libvespo).
Jean-Guillaume Dumas,
Aude Maignan,
Clément Pernet,
et
Daniel S. Roche.
PETS 2023 : 23rd Privacy Enhancing Technologies Symposium, pages 354--374, Lausanne, Suisse, 10--15 Juillet 2023. |
||||||||
| [ 97 ]
|
Some fast algorithms multiplying a matrix by its adjoint.
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
Journal of Symbolic Computation. Volume 115, pages 285--315, Mars-Avril 2023. |
||||||||
| [ 96 ]
|
What drives DeFi market returns?.
Jean-Guillaume Dumas,
Sonia
Jimenez Garces
et
Florentina Şoiman.
Journal of International Financial Markets, Institutions & Money. Volume 85, Juin 2023. |
||||||||
| [ 95 ]
|
|
||||||||
| 2022 | |
||||||||
| [ 94 ]
|
Optimal Threshold Padlock Systems.
Jannik Dreier,
Jean-Guillaume Dumas,
Pascal Lafourcade
et
Léo Robert.
Journal of Computer Security. Volume 30, number 5, pages 655--688, oct. 2022. |
||||||||
| [ 93 ]
|
|
||||||||
| [ 92 ]
|
|
||||||||
| 2021 | |
||||||||
| [ 91 ]
|
Dynamic proofs of retrievability with low server storage (C++ code).
Gaspard Anthoine,
Jean-Guillaume Dumas,
Michael Hanling,
Mélanie de Jonghe,
Aude Maignan,
Clément Pernet,
et
Daniel S. Roche.
SECURITY 2021 : 30th USENIX Security Symposium, pages 537--554, virtual event, 11--13 Août 2021. |
||||||||
| [ 90 ]
|
Blockchain
technology and the cryptomarket: vulnerabilities and risk assessment
.
Jean-Guillaume Dumas,
Sonia
Jimenez Garces
et
Florentina Şoiman. IMCIC 2021 : 12th International Conference on Complexity, Informatics and Cybernetics, pages 30--37, Orlando, USA, 9--12 Mars 2021. |
||||||||
| 2020 | |
||||||||
| [ 89 ]
|
On fast multiplication of a matrix by its transpose.
Jean-Guillaume Dumas,
Clément Pernet
et
Alexandre Sedoglavic.
ISSAC 2020 : ACM International Symposium on Symbolic and Algebraic Computations, pages 162--169, Kalamata, Grèce, 20--23 Juillet 2020. |
||||||||
| [ 88 ]
|
Elimination-based certificates for triangular equivalence and rank profiles.
Jean-Guillaume Dumas,
Erich L. Kaltofen,
Clément Pernet
et
David Lucas.
Journal of Symbolic Computation. Volume 98, pages 246--269, Mai-Juin 2020. |
||||||||
| [ 87 ]
|
A Faster Cryptographer's Conspiracy Santa.
Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas et Pascal Lafourcade. Theoretical Computer Science, volume 839, pages 122--134, novembre 2020. |
||||||||
| [ 86 ]
|
|
||||||||
| 2019 | |
||||||||
| [ 85 ]
|
LU
factorization with errors.
Jean-Guillaume Dumas, Joris van der Hoeven,
Clément Pernet et Daniel S. Roche. ISSAC 2019 : ACM International Symposium on Symbolic and Algebraic Computations, pages 131--138, Beijing, Chine, 15--18 Juillet 2019. |
||||||||
| [ 84 ]
|
LocalPKI: An Interoperable and IoT Friendly PKI (Tamarin files).
Jean-Guillaume Dumas, Pascal Lafourcade,
Francis Melemedjian, Jean-Baptiste Orfila et Pascal Thoniel.
Communications in Computer and Information Science. Volume 990, pages 224--252, Fév. 2019. |
||||||||
| [ 83 ]
|
Secure Multi-Party Matrix Multiplication Based on
Strassen-Winograd Algorithm.
Jean-Guillaume Dumas, Pascal Lafourcade,
Julio Ernesto López Fenner, David Lucas,
Jean-Baptiste Orfila,
Clément Pernet et Maxime Puys. IWSEC 2019 : 14th International Workshop on Security, Tokyo, Japon, 29--30 Août 2019. Lecture Notes in Computer Science, Advances in Information and Computer Security, Volume 11689, pages 67--88, Springer 2019. |
||||||||
| [ 82 ]
|
Interactive Physical Zero-Knowledge Proof for Norinori.
Jean-Guillaume Dumas, Pascal Lafourcade,
Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao,
Tatsuya Sasaki et
Hideaki Sone. COCOON 2019 : 25th International Computing and Combinatorics Conference, Xian, Chine, 29--31 Juillet 2019. Lecture Notes in Computer Science, Volume 11653, pages 166--177, Springer 2019. |
||||||||
| 2018 | |
||||||||
| [ 81 ]
|
Symmetric indefinite triangular factorization revealing the rank profile matrix.
Jean-Guillaume Dumas et Clément Pernet. ISSAC 2018 : ACM International Symposium on Symbolic and Algebraic Computations, pages 151--158, New York, USA, 16--19 Juillet 2018. |
||||||||
| [ 80 ]
|
A
Cryptographer's Conspiracy Santa.
Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas et Pascal Lafourcade. FUN 2018 : 9th International Conference on Fun with Algorithms, Maddalena Islands, Italie, 13--15 Juin 2018. Leibniz International Proceedings in Informatics. Volume 100, pages 13:1--13:13. |
||||||||
| [ 79 ]
|
Proof-of-work certificates that can be efficiently computed in the cloud.
Jean-Guillaume Dumas. CASC 2018 : 20th International Workshop on Computer Algebra in Scientific Computing, Lille, France, 17--21 Septembre 2018. Lecture Notes in Computer Science. Volume 11077, pages 1--17, Springer, Heidelberg, 2018. |
||||||||
| [ 78 ]
|
Physical Zero-Knowledge Proof for Makaro.
Xavier Bultel, Jannik Dreier,
Jean-Guillaume Dumas, Pascal Lafourcade,
Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao,
Tatsuya Sasaki, Kazumasa Shinagawa et
Hideaki Sone. SSS 2018 : 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Tokyo, Japon, 4--7 Novembre 2018. Lecture Notes in Computer Science. Volume 11201, pages 111--125, Springer, Heidelberg, 2018. |
||||||||
| [ 77 ]
|
|
||||||||
| [ 76 ]
|
|
||||||||
| 2017 | |
||||||||
| [ 75 ]
|
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 et
Lihong Zhi. ISSAC 2017 : ACM International Symposium on Symbolic and Algebraic Computations, pages 125--132, Kaiserslautern, Deutschland, 25--28 Juillet 2017. |
||||||||
| [ 74 ]
|
Certificates for triangular equivalence and rank profiles.
Jean-Guillaume Dumas, David Lucas et Clément Pernet. ISSAC 2017 : ACM International Symposium on Symbolic and Algebraic Computations, pages 133--140, Kaiserslautern, Deutschland, 25--28 Juillet 2017. |
||||||||
| [ 73 ]
|
Fast
Computation of the Rank Profile Matrix and the
Generalized Bruhat Decomposition.
Jean-Guillaume Dumas, Clément Pernet et Ziad Sultan. Journal of Symbolic Computation. Volume 83, pages 187--210, Nov-Déc 2017. |
||||||||
| [ 72 ]
|
Dual
protocols for private multi-party matrix
multiplication and trust computations (formalisation & implémentation).
Jean-Guillaume Dumas, Pascal Lafourcade,
Jean-Baptiste Orfila et Maxime Puys. Computers & Security. Volume 71, pages 51--70, Nov. 2017. |
||||||||
| [ 71 ]
|
Prover efficient public verification of dense or sparse/structured matrix-vector multiplication.
Jean-Guillaume Dumas et Vincent Zucca. ACISP 2017, 22nd Australasian Conference on Information Security and Privacy, Auckland, New Zealand, 3--7 Juillet 2017. Lecture Notes in Computer Science. Volume 10343, pages 115--134. |
||||||||
| [ 70 ]
|
LocalPKI: A User-Centric Formally Proven Alternative to PKIX (Tamarin files).
Jean-Guillaume Dumas, Pascal Lafourcade,
Francis Melemedjian, Jean-Baptiste Orfila et Pascal Thoniel.
SECRYPT 2017 : 14th International Conference on Security and Cryptography, Madrid, Espagne, 24--26 Juillet 2017. ICETE 2017. Volume 6, pages 187-199. |
||||||||
| [ 69 ]
|
Security
Architecture for Point-to-Point Splitting Protocols.
Benoît Badrignans, Vincent Danjean,
Jean-Guillaume Dumas,
Philippe Elbaz-Vincent,
Sabine Machenaud, Jean-Baptiste Orfila,
Florian Pebay-Peyroula,
François Pebay-Peyroula,
Marie-Laure Potet,
Maxime Puys,
Jean-Luc Richier et Jean-Louis Roch. WCICSS 2017 : IEEE World Congress on Industrial Control Systems Security, pages 22--29, Cambridge, UK, 11--14 Décembre 2017. |
||||||||
| 2016 | |
||||||||
| [ 68 ]
|
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 : ACM International Symposium on Symbolic and Algebraic Computations, pages 199--206, Waterloo, Canada, 20--22 Juillet 2016. |
||||||||
| [ 67 ]
|
Matrix multiplication over word-size modular rings using approximate formulae.
Brice Boyer et Jean-Guillaume Dumas. ACM Transactions on Mathematical Software, Volume 42, issue 3, pages 20:1--20:12, juin 2016. |
||||||||
| [ 66 ]
|
Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination.
Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet,
Jean-Louis Roch et Ziad Sultan. Parallel Computing, Volume 57, pages 235--249, Septembre 2016. |
||||||||
| [ 65 ]
|
Physical Zero-Knowledge Proofs for Akari, Kakuro, KenKen and Takuzu.
Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas et Pascal Lafourcade. FUN 2016 : 8th International Conference on Fun with Algorithms, Maddalena Islands, Italie, 8--10 Juin 2016. Leibniz International Proceedings in Informatics. Volume 49, pages 8:1--8:20. |
||||||||
| [ 64 ]
|
Private
Multi-party Matrix Multiplication and Trust
Computations (formalisation & implémentation).
Jean-Guillaume Dumas, Pascal Lafourcade,
Jean-Baptiste Orfila et Maxime Puys. SECRYPT 2016 : 13th International Conference on Security and Cryptography, (best paper award), Lisbonne, Portugal, 26--28 Juillet 2016. ICETE 2016. Volume 4, pages 61--72. |
||||||||
| [ 63 ]
|
Recursive double-size fixed precision arithmetic.
(C++ Givaro library).
Alexis Breust, Christophe Chabot, Jean-Guillaume Dumas,
Laurent Fousse et Pascal Giorgi. ICMS 2016 : 5th International Congress on Mathematical Software, Berlin, Allemagne, 11--15 Juillet 2016. Lecture Notes in Computer Science. Volume 9725, pages 223--231. |
||||||||
| 2015 | |
||||||||
| [ 62 ]
|
Computing the rank profile matrix.
Jean-Guillaume Dumas, Clément Pernet et Ziad Sultan. ISSAC 2015 : ACM International Symposium on Symbolic and Algebraic Computations (distinguished paper award), pages 146--153, Bath, UK, 6--10 Juillet 2015. |
||||||||
| [ 61 ]
|
Brandt's Fully Private Auction Protocol Revisited.
Jannik Dreier, Jean-Guillaume Dumas et Pascal Lafourcade. Journal of Computer Security, 23(5), pages 587--610, special issue on Security and High Performance Computing Systems, 2015. |
||||||||
| [ 60 ]
|
Relative Hilbert-Post completeness for exceptions.
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici,
Damien Pous et Jean-Claude Reynaud. MACIS 2015 : Sixth International Conference on Mathematical Aspects of Computer and Information Sciences, Berlin, Allemagne, 11--13 Novembre 2015. Lecture Notes in Computer Science. Volume 9582, pages 596--610. |
||||||||
| [ 59 ]
|
|
||||||||
| [ 58 ]
|
|
||||||||
| [ 57 ]
|
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é. Rapport de Recherche IMAG-hal-01171249, arXiv: cs.SC/1507.01083. Juillet 2015. |
||||||||
| 2014 | |
||||||||
| [ 56 ]
|
Essentially optimal interactive certificates in linear algebra.
Jean-Guillaume Dumas et
Erich L. Kaltofen. ISSAC 2014 : ACM International Symposium on Symbolic and Algebraic Computations, pages 146--153, Kobe, Japan, 23--25 Juillet 2014. |
||||||||
| [ 55 ]
|
Parallel computation of echelon forms.
Jean-Guillaume Dumas, Thierry Gautier,
Clément Pernet et Ziad Sultan. Euro-Par 2014 : 20th international conference on parallel processing, Porto, Portugal, 25--29 Août 2014. Lecture Notes in Computer Science. Volume 8632, pages 499--510. |
||||||||
| [ 54 ]
|
On Newton-Raphson iteration for multiplicative inverses modulo prime powers.
Jean-Guillaume Dumas. IEEE Transactions on Computers, volume 63, number 8, pages 2106--2109, août 2014. |
||||||||
| [ 53 ]
|
Elements of Design for Containers and Solutions in the LinBox Library.
(C++ LinBox library).
Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément
Pernet, B. David Saunders. ICMS 2014 : Fourth International Congress on Mathematical Software, Séoul, Corée, 5--9 Août 2014. Lecture Notes in Computer Science. Volume 8592, pages 654--662. |
||||||||
| [ 52 ]
|
Certified proofs in programs involving exceptions.
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici et
Jean-Claude Reynaud. CICM 2014 : Eigth Conference on Intelligent Computer Mathematics, Coimbra, Portugal, 7--11 Juillet 2014. CEUR Workshop Proceedings, n° 1186, paper 20. |
||||||||
| [ 51 ]
|
Formal verification in Coq of program properties involving the global state effect.
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici et
Damien Pous. JFLA 2014 : Journées Francophones des Langages Applicatifs, pages 1--15, Fréjus, France, 8--11 Janvier 2014. |
||||||||
| 2013 | |
||||||||
| [ 50 ]
|
Simultaneous computation of the row and column rank profiles.
Jean-Guillaume Dumas, Clément Pernet et Ziad Sultan. ISSAC 2013 : ACM International Symposium on Symbolic and Algebraic Computations, pages 181--188, Boston, USA, 26--29 Juin 2013. |
||||||||
| [ 49 ]
|
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source. Jean-Guillaume Dumas et
Grégory Nuel. Theoretical Computer Science, volume 479, special issue on Symbolic Numeric Algorithms, pages 22--42, avril 2013. |
||||||||
| [ 48 ]
|
Attacking Privacy in a Fully Private Auction Protocol.
Jannik Dreier, Jean-Guillaume Dumas et Pascal Lafourcade. AfricaCrypt 2013 : 6th International Conference on Cryptology in Africa, Le Caire, Égypte, 22--24 Juin 2013. Lecture Notes in Computer Science. Volume 7918, pages 88--106, Springer, Heidelberg, 2013. |
||||||||
| [ 47 ]
|
|
||||||||
| [ 46 ]
|
|
||||||||
| 2012 | |
||||||||
| [ 45 ]
|
A duality between exceptions and states.
Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse et
Jean-Claude Reynaud. Mathematical Structures in Computer Science, Volume 22, issue 4, pages 719--722, août 2012. |
||||||||
| [ 44 ]
|
Matrix Powers algorithms for trust evaluation in public-key infrastructures.
Jean-Guillaume Dumas et Hicham Hossayni. STM 2012 : 8th International Workshop on Security and Trust Management (part of ESORICS 2012), Pise, Italie, 10--14 septembre 2012. Lecture Notes in Computer Science. Volume 7783, pages 129--144, Springer, Heidelberg, 2013. |
||||||||
| [ 43 ]
|
Decorated proofs for computational effects: States.
Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse et
Jean-Claude Reynaud. ACCAT 2012 : 7th Applied and Computational Category Theory (part of ETAPS 2012), Tallinn, Estonie, 24 Mars -- 1 Avril 2012. Electronic Proceedings in Theoretical Computer Science, volume 93, pages 45--59, août 2012. |
||||||||
| 2011 | |
||||||||
| [ 42 ]
|
Rank properties of subspaces of symmetric
and hermitian matrices over finite fields. Jean-Guillaume Dumas, Roderick Gow et John Sheekey. Finite Fields and their Applications, Volume 17, Issue 6, pages 504--520, novembre 2011. | ||||||||
| [ 41 ]
|
Simultaneous
Modular Reduction and Kronecker Substitution for Small
Finite Fields.
Jean-Guillaume Dumas, Laurent Fousse et
Bruno Salvy. Journal of Symbolic Computations. Volume 46, issue 7, pages 823--840, juillet 2011. | ||||||||
| [ 40 ]
|
Cartesian
effect categories are Freyd-categories.
Jean-Guillaume Dumas, Dominique Duval et
Jean-Claude Reynaud. Journal of Symbolic Computations. Volume 46, issue 3, pages 272--293, mars 2011. |
||||||||
| 2010 | |
||||||||
| [ 39 ]
|
Subspaces of matrices with special rank properties.
Jean-Guillaume Dumas, Roderick Gow, Gary McGuire et John Sheekey. Linear Algebra and its Applications. Volume 433, Issue 1, pages 191--202, July 2010. |
||||||||
| [ 38 ]
|
Les rayons des permutations spirales.
Jean-Guillaume Dumas. Mathématiques et Sciences Humaines. Volume 192, nº 4, pages 5--27, hiver 2010. |
||||||||
| [ 37 ]
|
LinBox founding scope allocation, parallel building blocks, and
template separate compilation.
Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet et B. David Saunders. ICMS 2010 : Third International Congress on Mathematical Software, Kobe, Japon, 13--17 Septembre 2010. Lecture Notes in Computer Science. Volume 6327, pages 77--83. |
||||||||
| [ 36 ]
|
Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures.
Brice Boyer, Jean-Guillaume Dumas et Pascal Giorgi. PASCO 2010 : Parallel Symbolic Computation'10, pages 80--88, 21-23 juillet, Grenoble, France. |
||||||||
| [ 35 ]
|
Generic design of Chinese remaindering schemes.
Jean-Guillaume Dumas, Thierry Gautier et Jean-Louis Roch. PASCO 2010 : Parallel Symbolic Computation'10, pages 26--34, 21-23 juillet, Grenoble, France. |
||||||||
| [ 34 ]
|
|
||||||||
| 2009 | |
||||||||
| [ 33 ]
|
Memory
efficient scheduling of Strassen-Winograd's matrix
multiplication algorithm.
Brice Boyer, Jean-Guillaume Dumas,
Clément Pernet et Wei Zhou. ISSAC 2009 : ACM International Symposium on Symbolic and Algebraic Computations, pages 135--143, Séoul, Corée du Sud, 28-31 Juillet 2009. |
||||||||
| [ 32 ]
|
On
finding multiplicities of characteristic polynomial
factors of black-box matrices.
Jean-Guillaume Dumas, Clément Pernet et
B. David Saunders. ISSAC 2009 : ACM International Symposium on Symbolic and Algebraic Computations, pages 55--62, Séoul, Corée du Sud, 28-31 Juillet 2009. |
||||||||
| [ 31 ]
|
Fault
Attacks on RSA Public Keys: Left-To-Right Implementations
are also Vulnerable. Alexandre Berzati, Cécile Canovas,
Jean-Guillaume Dumas et Louis Goubin. CT-RSA 2009 : RSA Conference 2009, Cryptographers' Track San Francisco, USA, 20-24 avril 2009. Lecture Notes in Computer Science. Volume 5473, pages 414--428. |
||||||||
| 2008 | |
||||||||
| [ 30 ]
|
Q-adic
Transform revisited.
Jean-Guillaume Dumas. ISSAC 2008 : ACM International Symposium on Symbolic and Algebraic Computations, pages 63--69, Hagenberg, Autriche, 20-23 Juillet 2008. |
||||||||
| [ 29 ]
|
Dense
Linear Algebra over Finite Fields: the FFLAS and FFPACK
packages.
(C++ fflas-ffpack library).
Jean-Guillaume
Dumas, Pascal Giorgi et Clément Pernet. ACM Transactions on Mathematical Software. Volume 35, n° 3, 34 pp, Novembre 2008. |
||||||||
| [ 28 ]
|
Caractérisation
des Quenines et leur représentation
spirale.
Jean-Guillaume Dumas. Mathématiques et Sciences Humaines. n° 184, pages 9--23, volume 4, hiver 2008. |
||||||||
| [ 27 ]
|
Compressed
Modular Matrix Multiplication.
Jean-Guillaume Dumas, Laurent Fousse et
Bruno Salvy. MICA 2008 : Milestones in Computer Algebra, pages 133--140, Stonehaven Bay, Trinidad and Tobago, 1-3 May 2008. |
||||||||
| 2007 | |
||||||||
| [ 26 ]
|
Bounds
on the coefficients of the characteristic and minimal
polynomials.Jean-Guillaume Dumas. Journal of Inequalities in Pure and Applied Mathematics. vol. 8, n°2, art. 31, 6 pp, Avril 2007. |
||||||||
| [ 25 ]
|
|
||||||||
| [ 24 ]
|
Parallel
Computation of the Rank of Large Sparse Matrices from
Algebraic K-theory.
Jean-Guillaume Dumas, Pascal Giorgi,
Philippe Elbaz-Vincent et Anna Urbańska. PASCO 2007 : Parallel Symbolic Computation'07, pages 43--52, 26-27 juillet, Waterloo, Canada. |
||||||||
| 2006 | |
||||||||
| [ 23 ]
|
Efficient
polynomial time algorithms computing industrial-strength
primitive roots. Jacques
Dubrois et Jean-Guillaume Dumas. Information Processing Letters, 97/2, pages 41--45, janvier 2006. |
||||||||
|
|
||||||||
| [ 19 ]
|
Adaptive
Triangular System Solving.
Jean-Guillaume Dumas, Clément Pernet et
Jean-Louis Roch. Challenges in Symbolic Computation Software, Dagstuhl Seminar proceedings 06271, paper 770. Octobre 2006, Allemagne. |
||||||||
| [ 18 ]
|
An
introspective algorithm for the integer
determinant.
Jean-Guillaume Dumas et Anna Urbańska.
Transgressive Computing 2006, 24-27 avril, Grenade, Espagne, pages 185--202. |
||||||||
| [ 17 ]
|
Adaptive
and Hybrid Algorithms: classification and illustration on
triangular system solving.
Van-Dat Cung, Vincent Danjean, Jean-Guillaume
Dumas, Thierry Gautier, Guillaume Huard, Bruno Raffin,
Christophe Rapine, Jean-Louis Roch et
Denis Trystram.
Transgressive Computing 2006, 24-27 avril, Grenade, Espagne, pages 131--148. |
||||||||
| [ 16 ]
|
Towards
a diagrammatic modeling of the LinBox C++ linear algebra
library. Jean-Guillaume
Dumas et Dominique Duval. LMO 2006 : Langages et Modèles à Objets, 22-24 Mars 2006, Nîmes, France. |
||||||||
| 2005 | |
||||||||
| [ 15 ]
|
Algorithms
for symbolic/numeric control of affine dynamical
systems.
Jean-Guillaume Dumas et Aude Rondepierre.
ISSAC 2005 : ACM International Symposium on Symbolic and Algebraic Computations, pages 277--284, 24-27 Juillet 2005, Beijing, Chine. |
||||||||
| [ 14 ]
|
Efficient
Computation of the Characteristic
Polynomial.
Jean-Guillaume
Dumas, Clément Pernet et Zhendong Wan. ISSAC 2005 : ACM International Symposium on Symbolic and Algebraic Computations, pages 140--147, 24-27 Juillet 2005, Beijing, Chine. |
||||||||
| 2004 | |
||||||||
| [ 13 ]
|
FFPACK:
finite field linear algebra
package. Jean-Guillaume
Dumas, Pascal Giorgi et Clément Pernet. ISSAC 2004 : ACM International Symposium on Symbolic and Algebraic Computations, pages 119--126, 4-7 Juillet 2004, Santander, España. |
||||||||
| [ 12 ]
|
Efficient
dot product over finite fields.
Jean-Guillaume Dumas. CASC 2004 : Computer Algebra in Scientific Computing, pages 139--154, 12-19 Juillet 2004, Saint Petersburg, Russia. |
||||||||
| 2003 | |
||||||||
| [ 11 ]
|
Modeling the electrical activity of a neuron by a
continuous and piecewise linear hybrid
system.
Jean-Guillaume Dumas et
Aude Rondepierre. HSCC'03 (Hybrid Systems: Computation and Control), 3 -- 5 Avril 2003, Prague, république Tchèque. Lecture Notes in Computer Science. Volume 2623, pages 156--171. |
||||||||
| [ 10 ]
|
|
||||||||
| 2002 | |
||||||||
| [ 9 ]
|
FFLAS:
Finite field linear algebra subroutines.
Jean-Guillaume Dumas, Thierry Gautier et
Clément Pernet. ISSAC 2002 : ACM International Symposium on Symbolic and Algebraic Computations, pages 63--74, 7-10 Juillet 2002, Lille, France. |
||||||||
| [ 8 ]
|
Parallel block algorithms for exact
triangularizations.
Jean-Guillaume Dumas et Jean-Louis Roch.
Parallel Computing. Volume 28, numéro 11, novembre 2002, pages 1531--1548. |
||||||||
| [ 7 ]
|
Computing
the rank of large sparse matrices over finite
fields. Jean-Guillaume
Dumas et Gilles Villard. CASC 2002 : Computer Algebra in Scientific Computing, pages 47--62, 22 - 27 Septembre 2002, Big Yalta, Crimea, Ukraine. |
||||||||
| [ 6 ]
|
LinBox: A Generic Library for Exact Linear Algebra,
(PPT).
Jean-Guillaume Dumas, Thierry Gautier,
Mark W. Giesbrecht, Pascal Giorgi, Bradford Hovinen,
Erich L. Kaltofen, B. David Saunders, Will J. Turner
et
Gilles Villard. ICMS 2002 : International Congress of Mathematical Software, pages 40--50, 17 -- 19 Août, 2002, Beijing, China. |
||||||||
| 2001 | |
||||||||
| [ 5 ]
|
On
efficient sparse integer matrix Smith normal form
computations (HTML).
Jean-Guillaume Dumas,
B. David Saunders et Gilles Villard. Journal of Symbolic Computation. 32 (1/2), pages 71--99, Juillet/Août 2001. |
||||||||
| [ 4 ]
|
A
new parallel algorithm for exact triangularization of
rectangular matrices.
Jean-Guillaume Dumas et Jean-Louis Roch.
SPAA 2001 : Thirteenth ACM Symposium on Parallel Algorithms and Architectures, pages 324--325. 4-6 Juillet 2001, Crête. |
||||||||
| 2000 | |
||||||||
| [ 3 ]
|
Smith
form via the Valence : Experience with matrices from
homology (GAP software),
Jean-Guillaume Dumas, B. David Saunders et Gilles Villard. ISSAC 2000 : ACM International Symposium on Symbolic and Algebraic Computations, pages 95--105, 6-9 Août 2000, Saint Andrews, Écosse. |
||||||||
| [ 2 ]
|
Calcul
parallèle du polynôme minimal entier en
Athapascan-1 et Linbox.
Jean-Guillaume Dumas.
RenPar 2000 : Douzièmes Rencontres du Parallélisme, pages 119--124, 19-22 Juin, Besançon, France. |
||||||||
| [ 1 ]
|
|
|
Les codes
détecteurs et correcteurs d'erreurs pour la
fiabilité des calculs
Jean-Guillaume Dumas et Clément Pernet. Dans Le calcul à découvert, Mokrane Bouzeghoub, Michel Daydé et Christian Jutten, editeurs. CNRS, janvier 2025, pages 57--59. |
|
La sécurité de bitcoin et des blockchains.
Jean-Guillaume Dumas et Pascal Lafourcade. Dans Treize Défis de la cybersécurité, sous la direction de Gildas Avoine et Marc-Olivier Killijian. CNRS éditions, juin 2020, pages 213--232. |
|
Les crypto-monnaies, une
réalité virtuelle ?
Jean-Guillaume Dumas et Pascal Lafourcade. Dans Les Big Data à découvert, Mokrane Bouzeghoub and Rémy Mosseri, editeurs. CNRS, mars 2017, pages 298--299. |
| Dernière mise à jour : jeudi 11 décembre 2025 | http://membres-ljk.imag.fr/Jean-Guillaume.Dumas |
