Jean-Guillaume Dumas

According to our database1, Jean-Guillaume Dumas authored at least 58 papers between 2000 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Physical Zero-Knowledge Proof for Makaro.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

A Cryptographer's Conspiracy Santa.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017
Fast computation of the rank profile matrix and the generalized Bruhat decomposition.
J. Symb. Comput., 2017

Dual protocols for private multi-party matrix multiplication and trust computations.
Computers & Security, 2017

LOCALPKI: A User-Centric Formally Proven Alternative to PKIX.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

Certificates for Triangular Equivalence and Rank Profiles.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas.
ACM Trans. Math. Softw., 2016

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination.
Parallel Computing, 2016

Private Multi-party Matrix Multiplication and Trust Computations.
Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016), 2016

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Recursive Double-Size Fixed Precision Arithmetic.
Proceedings of the Mathematical Software - ICMS 2016, 2016

Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Relative Hilbert-Post Completeness for Exceptions.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Computing the Rank Profile Matrix.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
On Newton-Raphson Iteration for Multiplicative Inverses Modulo Prime Powers.
IEEE Trans. Computers, 2014

Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula.
ACM Comm. Computer Algebra, 2014

Certified Proofs in Programs Involving Exceptions.
Proceedings of the Joint Proceedings of the MathUI, 2014

Formal verification in Coq of program properties involving the global state effect.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Essentially optimal interactive certificates in linear algebra.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Parallel Computation of Echelon Forms.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

2013
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source.
Theor. Comput. Sci., 2013

Simultaneous computation of the row and column rank profiles.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Brandt's Fully Private Auction Protocol Revisited.
Proceedings of the Progress in Cryptology, 2013

2012
A duality between exceptions and states.
Mathematical Structures in Computer Science, 2012

Decorated proofs for computational effects: States
Proceedings of the Proceedings Seventh ACCAT Workshop on Applied and Computational Category Theory, 2012

Matrix Powers Algorithms for Trust Evaluation in Public-Key Infrastructures.
Proceedings of the Security and Trust Management - 8th International Workshop, 2012

2011
Simultaneous modular reduction and Kronecker substitution for small finite fields.
J. Symb. Comput., 2011

Cartesian effect categories are Freyd-categories.
J. Symb. Comput., 2011

Rank properties of subspaces of symmetric and hermitian matrices over finite fields.
Finite Fields and Their Applications, 2011

2010
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation.
Proceedings of the Mathematical Software, 2010

Generic design of Chinese remaindering schemes.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Exact sparse matrix-vector multiplication on GPU's and multicore architectures.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Contributions au calcul exact intensif. (Contributions to high-performance computer algebra).
, 2010

2009
On finding multiplicities of characteristic polynomial factors of black-box matrices.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable.
Proceedings of the Topics in Cryptology, 2009

2008
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages.
ACM Trans. Math. Softw., 2008

Q-adic transform revisited.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Parallel computation of the rank of large sparse matrices from algebraic K-theory.
Proceedings of the Parallel Symbolic Computation, 2007

2006
Efficient polynomial time algorithms computing industrial-strength primitive roots.
Inf. Process. Lett., 2006

Vers une modélisation diagrammatique de la bibliothèque C++ d'algèbre linéaire LinBox.
Proceedings of the Actes des journéees Langages et Modèles à Objets, 2006

Adaptive Triangular System Solving.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
Algorithms for symbolic/numeric control of affine dynamical systems.
Proceedings of the Symbolic and Algebraic Computation, 2005

Efficient computation of the characteristic polynomial.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
FFPACK: finite field linear algebra package.
Proceedings of the Symbolic and Algebraic Computation, 2004

2003
Modeling the Electrical Activity of a Neuron by a Continuous and Piecewise Affine Hybrid System.
Proceedings of the Hybrid Systems: Computation and Control, 2003

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002
On parallel block algorithms for exact triangularizations.
Parallel Computing, 2002

Finite field linear algebra subroutines.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
On Efficient Sparse Integer Matrix Smith Normal Form Computations.
J. Symb. Comput., 2001

A parallel block algorithm for exact triangularization of rectangular matrices.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

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).
PhD thesis, 2000

Integer Smith form via the valence: experience with large sparse matrices from homology.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000


  Loading...