| Publication | Date of Publication | Type |
|---|
Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
Journal of Symbolic Computation | 2025-11-28 | Paper |
Fast in-place accumulation
Journal of Symbolic Computation | 2025-11-28 | Paper |
| Strassen's algorithm is not optimally accurate | 2025-02-03 | Paper |
| In-place fast polynomial modular remainder | 2025-02-03 | Paper |
| In-place accumulation of fast multiplication formulae | 2025-02-03 | Paper |
| Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm | 2024-03-14 | Paper |
Physical zero-knowledge proof for Makaro
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Some fast algorithms multiplying a matrix by its adjoint
Journal of Symbolic Computation | 2022-09-22 | Paper |
On fast multiplication of a matrix by its transpose
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
LU factorization with errors
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Certificates for triangular equivalence and rank profiles
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
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 | 2020-09-09 | Paper |
Symmetric indefinite triangular factorization revealing the rank profile matrix
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
A faster cryptographer's Conspiracy Santa
Theoretical Computer Science | 2020-09-03 | Paper |
| A cryptographer's Conspiracy Santa | 2020-08-11 | Paper |
| Optimal Threshold Padlock Systems | 2020-04-24 | Paper |
| Interactive physical zero-knowledge proof for Norinori | 2020-02-24 | Paper |
Elimination-based certificates for triangular equivalence and rank profiles
Journal of Symbolic Computation | 2020-01-15 | Paper |
Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
(available as arXiv preprint) | 2018-10-23 | Paper |
Prover efficient public verification of dense or sparse/structured matrix-vector multiplication
(available as arXiv preprint) | 2017-08-25 | Paper |
Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
(available as arXiv preprint) | 2017-07-17 | Paper |
On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
IEEE Transactions on Computers | 2017-06-20 | Paper |
Fast computation of the rank profile matrix and the generalized Bruhat decomposition
Journal of Symbolic Computation | 2017-06-01 | Paper |
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 | 2017-05-10 | Paper |
Simultaneous computation of the row and column rank profiles
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Computing the rank profile matrix
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Recursive double-size fixed precision arithmetic
Mathematical Software – ICMS 2016 | 2016-09-28 | Paper |
Relative Hilbert-Post completeness for exceptions
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Integer Smith form via the valence: experience with large sparse matrices from homology
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Essentially optimal interactive certificates in linear algebra
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
Algorithms for symbolic/numeric control of affine dynamical systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
| Foundations of coding. Compression, encryption, error correction | 2015-02-20 | Paper |
Elements of design for containers and solutions in the LinBox library (extended abstract)
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
Theoretical Computer Science | 2013-11-29 | Paper |
Brandt's fully private auction protocol revisited
Progress in Cryptology – AFRICACRYPT 2013 | 2013-06-07 | Paper |
A duality between exceptions and states
MSCS. Mathematical Structures in Computer Science | 2012-09-06 | Paper |
| Adjunctions for exceptions | 2012-07-05 | Paper |
On finding multiplicities of characteristic polynomial factors of black-box matrices
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
| Decorated proofs for computational effects: Exceptions | 2012-03-13 | Paper |
| A duality between exceptions and states | 2011-12-11 | Paper |
| Decorated proofs for computational effects: States | 2011-12-11 | Paper |
Rank properties of subspaces of symmetric and Hermitian matrices over finite fields
Finite Fields and their Applications | 2011-12-07 | Paper |
Les rayons des permutations spirales
Mathématiques et sciences humaines | 2011-08-25 | Paper |
Simultaneous modular reduction and Kronecker substitution for small finite fields
Journal of Symbolic Computation | 2011-06-01 | Paper |
Cartesian effect categories are Freyd-categories
Journal of Symbolic Computation | 2011-03-14 | Paper |
LinBox founding scope allocation, parallel building blocks, and separate compilation
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
| An introspective algorithm for the integer determinant | 2010-06-17 | Paper |
| scientific article; zbMATH DE number 5722792 (Why is no real title available?) | 2010-06-17 | Paper |
Subspaces of matrices with special rank properties
Linear Algebra and its Applications | 2010-05-21 | Paper |
Efficient polynomial time algorithms computing industrial-strength primitive roots
Information Processing Letters | 2009-12-18 | Paper |
Caractérisation des quenines et leur représentation spirale
Mathématiques et sciences humaines | 2009-07-06 | Paper |
Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Q-adic transform revisited
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
| Bounds on the coefficients of the characteristic and minimal polynomials | 2008-01-09 | Paper |
| Bounds on the coefficients of the characteristic and minimal polynomials | 2008-01-09 | Paper |
| scientific article; zbMATH DE number 2151219 (Why is no real title available?) | 2005-04-04 | Paper |
FFPACK
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
On efficient sparse integer matrix Smith normal form computations
Journal of Symbolic Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1961543 (Why is no real title available?) | 2003-08-07 | Paper |
| scientific article; zbMATH DE number 1956628 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1860706 (Why is no real title available?) | 2003-01-28 | Paper |
On parallel block algorithms for exact triangularizations
Parallel Computing | 2003-01-21 | Paper |
Strassen's algorithm is not optimally accurate
(available as arXiv preprint) | N/A | Paper |
