Jean-Guillaume Dumas

Erich L. Kaltofen

Emmanuel Thomé

CoRR, 2015

Hilbert-Post completeness for the state and the exception effects.

[BibT_eX]

[DOI]

CoRR, 2015

Relative Hilbert-Post Completeness for Exceptions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Computing the Rank Profile Matrix.

[BibT_eX]

[DOI]

Ziad Sultan

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.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

Generating S-Boxes from Semi-fields Pseudo-extensions.

[BibT_eX]

[DOI]

Jean-Baptiste Orfila

CoRR, 2014

Breaking a monad-comonad symmetry between computational effects.

[BibT_eX]

[DOI]

CoRR, 2014

Program certification with computational effects.

[BibT_eX]

[DOI]

CoRR, 2014

Elements of Design for Containers and Solutions in the LinBox Library.

[BibT_eX]

[DOI]

CoRR, 2014

Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula.

[BibT_eX]

[DOI]

Brice Boyer

ACM Commun. Comput. Algebra, 2014

Certified Proofs in Programs Involving Exceptions.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the MathUI, 2014

Formal verification in Coq of program properties involving the global state effect.

[BibT_eX]

Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Essentially optimal interactive certificates in linear algebra.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Parallel Computation of Echelon Forms.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Grégory Nuel

Theor. Comput. Sci., 2013

A decorated proof system for exceptions.

[BibT_eX]

[DOI]

CoRR, 2013

Patterns for computational effects arising from a monad or a comonad.

[BibT_eX]

[DOI]

CoRR, 2013

Simultaneous computation of the row and column rank profiles.

[BibT_eX]

[DOI]

Ziad Sultan

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Computational linear algebra over finite fields.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

A duality between exceptions and states.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

Attacking Privacy in a Fully Private Auction Protocol

[BibT_eX]

[DOI]

Jannik Dreier

Pascal Lafourcade

CoRR, 2012

Adjunctions for exceptions

[BibT_eX]

[DOI]

CoRR, 2012

Computational linear algebra over finite fields

[BibT_eX]

[DOI]

CoRR, 2012

Decorated proofs for computational effects: Exceptions

[BibT_eX]

[DOI]

CoRR, 2012

Decorated proofs for computational effects: States

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh ACCAT Workshop on Applied and Computational Category Theory, 2012

Matrix Powers Algorithms for Trust Evaluation in Public-Key Infrastructures.

[BibT_eX]

[DOI]

Hicham Hossayni

Proceedings of the Security and Trust Management - 8th International Workshop, 2012

2011

Simultaneous modular reduction and Kronecker substitution for small finite fields.

[BibT_eX]

[DOI]

Laurent Fousse

Bruno Salvy

J. Symb. Comput., 2011

Cartesian effect categories are Freyd-categories.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Rank properties of subspaces of symmetric and hermitian matrices over finite fields.

[BibT_eX]

[DOI]

Rod Gow

John Sheekey

Finite Fields Their Appl., 2011

Matrix Powers algorithm for trust evaluation in PKI architectures

[BibT_eX]

[DOI]

Hicham Hossayni

CoRR, 2011

Recursive double-size fixed precision arithmetic

[BibT_eX]

[DOI]

CoRR, 2011

2010

States and exceptions are dual effects

[BibT_eX]

[DOI]

CoRR, 2010

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software, 2010

Generic design of Chinese remaindering schemes.

[BibT_eX]

[DOI]

Thierry Gautier

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Exact sparse matrix-vector multiplication on GPU's and multicore architectures.

[BibT_eX]

[DOI]

Brice Boyer

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

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

[BibT_eX]

[DOI]

, 2010

2009

On finding multiplicities of characteristic polynomial factors of black-box matrices.

[BibT_eX]

[DOI]

B. David Saunders

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2009

2008

Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2008

Compressed Modular Matrix Multiplication

[BibT_eX]

[DOI]

Laurent Fousse

Bruno Salvy

CoRR, 2008

Q-adic transform revisited.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

[BibT_eX]

[DOI]

Wei Zhou

CoRR, 2007

Sequential products in effect categories

[BibT_eX]

[DOI]

CoRR, 2007

Parallel computation of the rank of large sparse matrices from algebraic K-theory.

[BibT_eX]

[DOI]

Philippe Elbaz-Vincent

Anna Urbanska

Proceedings of the Parallel Symbolic Computation, 2007

2006

Efficient polynomial time algorithms computing industrial-strength primitive roots.

[BibT_eX]

[DOI]

Jacques Dubrois

Inf. Process. Lett., 2006

Bounds on the coefficients of the characteristic and minimal polynomials

[BibT_eX]

[DOI]

CoRR, 2006

Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages

[BibT_eX]

[DOI]

CoRR, 2006

Vers une modélisation diagrammatique de la bibliothèque C++ d'algèbre linéaire LinBox.

[BibT_eX]

Proceedings of the Actes des journéees Langages et Modèles à Objets, 2006

Adaptive Triangular System Solving.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005

Algorithms for Hybrid Optimal Control

[BibT_eX]

[DOI]

Aude Rondepierre

CoRR, 2005

An introspective algorithm for the integer determinant

[BibT_eX]

[DOI]

Anna Urbanska

CoRR, 2005

Towards a diagrammatic modeling of the LinBox C++ linear algebra library

[BibT_eX]

[DOI]

CoRR, 2005

Algorithms for symbolic/numeric control of affine dynamical systems.

[BibT_eX]

[DOI]

Aude Rondepierre

Proceedings of the Symbolic and Algebraic Computation, 2005

Efficient computation of the characteristic polynomial.

[BibT_eX]

[DOI]

Zhendong Wan

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Efficient dot product over word-size finite fields

[BibT_eX]

[DOI]

CoRR, 2004

FFPACK: finite field linear algebra package.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Modeling the Electrical Activity of a Neuron by a Continuous and Piecewise Affine Hybrid System.

[BibT_eX]

[DOI]

Aude Rondepierre

Proceedings of the Hybrid Systems: Computation and Control, 2003

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.

[BibT_eX]

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002

On parallel block algorithms for exact triangularizations.

[BibT_eX]

[DOI]

Parallel Comput., 2002

Finite field linear algebra subroutines.

[BibT_eX]

[DOI]

Thierry Gautier

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

On Efficient Sparse Integer Matrix Smith Normal Form Computations.

[BibT_eX]

[DOI]

B. David Saunders

Gilles Villard

J. Symb. Comput., 2001

A parallel block algorithm for exact triangularization of rectangular matrices.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

PhD thesis, 2000

Integer Smith form via the valence: experience with large sparse matrices from homology.

[BibT_eX]

[DOI]