default search action
Jean-Guillaume Dumas
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c50]Jean-Guillaume Dumas, Bruno Grenet:
In-place accumulation of fast multiplication formulae. ISSAC 2024: 16-25 - [c49]Jean-Guillaume Dumas, Bruno Grenet:
In-place fast polynomial modular remainder. ISSAC 2024: 26-35 - [c48]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. ISSAC 2024: 254-263 - [i67]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. CoRR abs/2402.05630 (2024) - [i66]Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche:
Communication Optimal Unbalanced Private Set Union. CoRR abs/2402.16393 (2024) - 2023
- [j21]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. J. Symb. Comput. 115: 285-315 (2023) - [j20]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. 2023(3): 354-374 (2023) - [i65]Jean-Guillaume Dumas, Bruno Grenet:
In-place fast polynomial modular remainder. CoRR abs/2302.13600 (2023) - [i64]Florentina Soiman, Mathis Mourey, Jean-Guillaume Dumas, Sonia Jimenez-Garces:
The forking effect. CoRR abs/2307.11718 (2023) - [i63]Jean-Guillaume Dumas, Bruno Grenet:
Fast in-place accumulated bilinear formulae. CoRR abs/2307.12712 (2023) - 2022
- [j19]Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Léo Robert:
Optimal threshold padlock systems. J. Comput. Secur. 30(5): 655-688 (2022) - 2021
- [c47]Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. USENIX Security Symposium 2021: 537-554 - [i62]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. CoRR abs/2101.01025 (2021) - [i61]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials. CoRR abs/2110.02022 (2021) - 2020
- [j18]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. J. Symb. Comput. 98: 246-269 (2020) - [j17]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A faster cryptographer's Conspiracy Santa. Theor. Comput. Sci. 839: 122-134 (2020) - [c46]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. ISSAC 2020: 162-169 - [i60]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. CoRR abs/2001.04109 (2020) - [i59]Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Léo Robert:
Optimal Threshold Padlock Systems. CoRR abs/2004.11552 (2020) - [i58]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A Faster Cryptographer's Conspiracy Santa. CoRR abs/2005.09244 (2020) - [i57]Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. CoRR abs/2007.12556 (2020)
2010 – 2019
- 2019
- [c45]Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
Poster: Proofs of Retrievability with Low Server Storage. CCS 2019: 2601-2603 - [c44]Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone:
Interactive Physical Zero-Knowledge Proof for Norinori. COCOON 2019: 166-177 - [c43]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU Factorization with Errors. ISSAC 2019: 131-138 - [c42]Jean-Guillaume Dumas, Pascal Lafourcade, Julio López Fenner, David Lucas, Jean-Baptiste Orfila, Clément Pernet, Maxime Puys:
Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm. IWSEC 2019: 67-88 - [i56]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU factorization with errors. CoRR abs/1901.10730 (2019) - [i55]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. CoRR abs/1909.05692 (2019) - 2018
- [c41]Jean-Guillaume Dumas:
Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk). CASC 2018: 1-17 - [c40]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A Cryptographer's Conspiracy Santa. FUN 2018: 13:1-13:13 - [c39]Jean-Guillaume Dumas, Clément Pernet:
Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix. ISSAC 2018: 151-158 - [c38]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone:
Physical Zero-Knowledge Proof for Makaro. SSS 2018: 111-125 - [i54]Jean-Guillaume Dumas, Clément Pernet:
Symmetric indefinite triangular factorization revealing the rank profile matrix. CoRR abs/1802.10453 (2018) - [i53]Jean-Guillaume Dumas:
Proof-of-work certificates that can be efficiently computed in the cloud. CoRR abs/1806.11293 (2018) - 2017
- [j16]Jean-Guillaume Dumas, Pascal Lafourcade, Jean-Baptiste Orfila, Maxime Puys:
Dual protocols for private multi-party matrix multiplication and trust computations. Comput. Secur. 71: 51-70 (2017) - [j15]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Fast computation of the rank profile matrix and the generalized Bruhat decomposition. J. Symb. Comput. 83: 187-210 (2017) - [c37]Jean-Guillaume Dumas, Vincent Zucca:
Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication. ACISP (2) 2017: 115-134 - [c36]Jean-Guillaume Dumas, Pascal Lafourcade, Francis Melemedjian, Jean-Baptiste Orfila, Pascal Thoniel:
LocalPKI: An Interoperable and IoT Friendly PKI. ICETE (Selected Papers) 2017: 224-252 - [c35]Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi:
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. ISSAC 2017: 125-132 - [c34]Jean-Guillaume Dumas, David Lucas, Clément Pernet:
Certificates for Triangular Equivalence and Rank Profiles. ISSAC 2017: 133-140 - [c33]Jean-Guillaume Dumas, Pascal Lafourcade, Francis Melemedjian, Jean-Baptiste Orfila, Pascal Thoniel:
LOCALPKI: A User-Centric Formally Proven Alternative to PKIX. SECRYPT 2017: 187-199 - [i52]Jean-Guillaume Dumas, David Lucas, Clément Pernet:
Certificates for triangular equivalence and rank profiles. CoRR abs/1702.03755 (2017) - [i51]Jean-Guillaume Dumas, Vincent Zucca:
Prover efficient public verification of dense or sparse/structured matrix-vector multiplication. CoRR abs/1704.02768 (2017) - 2016
- [j14]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Jean-Louis Roch, Ziad Sultan:
Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination. Parallel Comput. 57: 235-249 (2016) - [j13]Brice Boyer, Jean-Guillaume Dumas:
Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas. ACM Trans. Math. Softw. 42(3): 20:1-20:12 (2016) - [c32]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. FUN 2016: 8:1-8:20 - [c31]Alexis Breust, Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse, Pascal Giorgi:
Recursive Double-Size Fixed Precision Arithmetic. ICMS 2016: 223-231 - [c30]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC 2016: 199-206 - [c29]Jean-Guillaume Dumas, Pascal Lafourcade, Jean-Baptiste Orfila, Maxime Puys:
Private Multi-party Matrix Multiplication and Trust Computations. SECRYPT 2016: 61-72 - [i50]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition. CoRR abs/1601.01798 (2016) - [i49]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR abs/1602.00810 (2016) - [i48]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. CoRR abs/1606.01045 (2016) - [i47]Jean-Guillaume Dumas, Pascal Lafourcade, Jean-Baptiste Orfila, Maxime Puys:
Private Multi-party Matrix Multiplication and Trust Computations. CoRR abs/1607.03629 (2016) - [i46]Jean-Guillaume Dumas, Victor Y. Pan:
Fast Matrix Multiplication and Symbolic Computation. CoRR abs/1612.05766 (2016) - 2015
- [j12]Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Brandt's fully private auction protocol revisited. J. Comput. Secur. 23(5): 587-610 (2015) - [c28]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Computing the Rank Profile Matrix. ISSAC 2015: 149-156 - [c27]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud:
Relative Hilbert-Post Completeness for Exceptions. MACIS 2015: 596-610 - [e2]Jean-Guillaume Dumas, Jean-Louis Roch, Eric Tannier, Sébastien Varrette:
Foundations of Coding - Compression, Encryption, Error Correction. Wiley 2015, ISBN 978-1-118-88144-6, pp. I-XVIII, 1-355 - [e1]Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet:
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015. ACM 2015, ISBN 978-1-4503-3599-7 [contents] - [i45]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Computing the Rank Profile Matrix. CoRR abs/1501.05239 (2015) - [i44]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud:
Hilbert-Post completeness for the state and the exception effects. CoRR abs/1503.00948 (2015) - [i43]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé:
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. CoRR abs/1507.01083 (2015) - 2014
- [j11]Brice Boyer, Jean-Guillaume Dumas:
Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula. ACM Commun. Comput. Algebra 48(3/4): 100-102 (2014) - [j10]Jean-Guillaume Dumas:
On Newton-Raphson Iteration for Multiplicative Inverses Modulo Prime Powers. IEEE Trans. Computers 63(8): 2106-2109 (2014) - [c26]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan:
Parallel Computation of Echelon Forms. Euro-Par 2014: 499-510 - [c25]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. ICMS 2014: 654-662 - [c24]Jean-Guillaume Dumas, Erich L. Kaltofen:
Essentially optimal interactive certificates in linear algebra. ISSAC 2014: 146-153 - [c23]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Formal verification in Coq of program properties involving the global state effect. JFLA 2014: 1-16 - [c22]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Jean-Claude Reynaud:
Certified Proofs in Programs Involving Exceptions. CICM Workshops 2014 - [i42]Jean-Guillaume Dumas, Erich L. Kaltofen:
Essentially optimal interactive certificates in linear algebra. CoRR abs/1401.4567 (2014) - [i41]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
Breaking a monad-comonad symmetry between computational effects. CoRR abs/1402.1051 (2014) - [i40]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan:
Parallel computation of echelon forms. CoRR abs/1402.3501 (2014) - [i39]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library. CoRR abs/1407.3262 (2014) - [i38]Jean-Guillaume Dumas, Jean-Baptiste Orfila:
Generating S-Boxes from Semi-fields Pseudo-extensions. CoRR abs/1411.2503 (2014) - [i37]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Program certification with computational effects. CoRR abs/1411.7140 (2014) - 2013
- [j9]Grégory Nuel, Jean-Guillaume Dumas:
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source. Theor. Comput. Sci. 479: 22-42 (2013) - [c21]Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Brandt's Fully Private Auction Protocol Revisited. AFRICACRYPT 2013: 88-106 - [c20]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Simultaneous computation of the row and column rank profiles. ISSAC 2013: 181-188 - [p1]Jean-Guillaume Dumas, Clément Pernet:
Computational linear algebra over finite fields. Handbook of Finite Fields 2013: 520-534 - [i36]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Simultaneous computation of the row and column rank profiles. CoRR abs/1301.4438 (2013) - [i35]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
Patterns for computational effects arising from a monad or a comonad. CoRR abs/1310.0605 (2013) - [i34]Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous:
Formal verification in Coq of program properties involving the global state effect. CoRR abs/1310.0794 (2013) - [i33]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
A decorated proof system for exceptions. CoRR abs/1310.2338 (2013) - 2012
- [j8]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
A duality between exceptions and states. Math. Struct. Comput. Sci. 22(4): 719-722 (2012) - [c19]Jean-Guillaume Dumas, Hicham Hossayni:
Matrix Powers Algorithms for Trust Evaluation in Public-Key Infrastructures. STM 2012: 129-144 - [c18]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
Decorated proofs for computational effects: States. ACCAT 2012: 45-59 - [i32]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
Decorated proofs for computational effects: Exceptions. CoRR abs/1203.2900 (2012) - [i31]Jean-Guillaume Dumas, Clément Pernet:
Computational linear algebra over finite fields. CoRR abs/1204.3735 (2012) - [i30]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
Adjunctions for exceptions. CoRR abs/1207.1255 (2012) - [i29]Jean-Guillaume Dumas:
On Newton-Raphson iteration for multiplicative inverses modulo prime powers. CoRR abs/1209.6626 (2012) - [i28]Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Attacking Privacy in a Fully Private Auction Protocol. CoRR abs/1210.6780 (2012) - 2011
- [j7]Jean-Guillaume Dumas, Rod Gow, John Sheekey:
Rank properties of subspaces of symmetric and hermitian matrices over finite fields. Finite Fields Their Appl. 17(6): 504-520 (2011) - [j6]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
Cartesian effect categories are Freyd-categories. J. Symb. Comput. 46(3): 272-293 (2011) - [j5]Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy:
Simultaneous modular reduction and Kronecker substitution for small finite fields. J. Symb. Comput. 46(7): 823-840 (2011) - [i27]Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse, Pascal Giorgi:
Recursive double-size fixed precision arithmetic. CoRR abs/1104.0478 (2011) - [i26]Jean-Guillaume Dumas, Hicham Hossayni:
Matrix Powers algorithm for trust evaluation in PKI architectures. CoRR abs/1107.1880 (2011) - [i25]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
A duality between exceptions and states. CoRR abs/1112.2394 (2011) - 2010
- [b2]Jean-Guillaume Dumas:
Contributions au calcul exact intensif. (Contributions to high-performance computer algebra). Grenoble Alpes University, France, 2010 - [c17]Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis Roch:
Generic design of Chinese remaindering schemes. PASCO 2010: 26-34 - [c16]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi:
Exact sparse matrix-vector multiplication on GPU's and multicore architectures. PASCO 2010: 80-88 - [c15]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. ICMS 2010: 77-83 - [i24]Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud:
States and exceptions are dual effects. CoRR abs/1001.1662 (2010) - [i23]Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis Roch:
Generic design of Chinese remaindering schemes. CoRR abs/1001.4150 (2010) - [i22]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi:
Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures. CoRR abs/1004.3719 (2010) - [i21]Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis Roch:
Generic design of Chinese remaindering schemes. CoRR abs/1005.0830 (2010) - [i20]Grégory Nuel, Jean-Guillaume Dumas:
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source. CoRR abs/1006.3246 (2010) - [i19]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox founding scope allocation, parallel building blocks, and separate compilation. CoRR abs/1009.1317 (2010)
2000 – 2009
- 2009
- [c14]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 - [c13]Brice Boyer, Jean-Guillaume Dumas, Clément Pernet, Wei Zhou:
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. ISSAC 2009: 55-62 - [c12]Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009: 135-142 - [i18]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) - [i17]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) - [i16]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
Cartesian effect categories are Freyd-categories. CoRR abs/0903.3311 (2009) - 2008
- [j4]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): 19:1-19:42 (2008) - [c11]Jean-Guillaume Dumas:
Q-adic transform revisited. ISSAC 2008: 63-70 - [i15]Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy:
Compressed Modular Matrix Multiplication. CoRR abs/0803.1975 (2008) - [i14]Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy:
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields. CoRR abs/0809.0063 (2008) - 2007
- [c10]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 - [i13]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) - [i12]Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud:
Sequential products in effect categories. CoRR abs/0707.1432 (2007) - [i11]Jean-Guillaume Dumas, Clément Pernet, Wei Zhou:
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. CoRR abs/0707.2347 (2007) - [i10]Jean-Guillaume Dumas:
Q-adic Transform revisited. CoRR abs/0710.0510 (2007) - 2006
- [j3]Jacques Dubrois, Jean-Guillaume Dumas:
Efficient polynomial time algorithms computing industrial-strength primitive roots. Inf. Process. Lett. 97(2): 41-45 (2006) - [c9]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 - [i9]Jean-Guillaume Dumas, Clément Pernet, Jean-Louis Roch:
Adaptive Triangular System Solving. Challenges in Symbolic Computation Software 2006 - [i8]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) - [i7]Jean-Guillaume Dumas:
Bounds on the coefficients of the characteristic and minimal polynomials. CoRR abs/cs/0610136 (2006) - 2005
- [c8]Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan:
Efficient computation of the characteristic polynomial. ISSAC 2005: 140-147 - [c7]Aude Rondepierre, Jean-Guillaume Dumas:
Algorithms for symbolic/numeric control of affine dynamical systems. ISSAC 2005: 277-284 - [i6]Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan:
Efficient Computation of the Characteristic Polynomial. CoRR abs/cs/0501074 (2005) - [i5]Jean-Guillaume Dumas, Dominique Duval:
Towards a diagrammatic modeling of the LinBox C++ linear algebra library. CoRR abs/cs/0510057 (2005) - [i4]Jean-Guillaume Dumas, Anna Urbanska:
An introspective algorithm for the integer determinant. CoRR abs/cs/0511066 (2005) - [i3]Jean-Guillaume Dumas, Aude Rondepierre:
Algorithms for Hybrid Optimal Control. CoRR abs/math/0502172 (2005) - 2004
- [c6]Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet:
FFPACK: finite field linear algebra package. ISSAC 2004: 119-126 - [i2]Jean-Guillaume Dumas:
Efficient dot product over word-size finite fields. CoRR cs.SC/0404008 (2004) - [i1]Jacques Dubrois, Jean-Guillaume Dumas:
Efficient polynomial time algorithms computing industrial-strength primitive roots. CoRR cs.SC/0409029 (2004) - 2003
- [c5]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 - [c4]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
- [j2]Jean-Guillaume Dumas, Jean-Louis Roch:
On parallel block algorithms for exact triangularizations. Parallel Comput. 28(11): 1531-1548 (2002) - [c3]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet:
Finite field linear algebra subroutines. ISSAC 2002: 63-74 - 2001
- [j1]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) - [c2]Jean-Guillaume Dumas, Jean-Louis Roch:
A parallel block algorithm for exact triangularization of rectangular matrices. SPAA 2001: 324-325 - 2000
- [b1]Jean-Guillaume Dumas:
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). Grenoble Institute of Technology, France, 2000 - [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint