- On fast multiplication of a matrix by its transpose
- Elimination-based certificates for triangular equivalence and rank profiles
- Interactive Certificates for Polynomial Matrices with Sub-Linear Communication
- Exploiting fast matrix arithmetic in block low-rank factorizations
- LU factorization with errors
- Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm
- Symmetric indefinite triangular factorization revealing the rank profile matrix
- Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
- Certificates for triangular equivalence and rank profiles
- Time and space efficient generators for quasiseparable matrices
- Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction
- Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition
- Dual protocols for private multi-party matrix multiplication and trust computations
- Prover efficient public verification of dense or sparse/structured matrix-vector multiplication
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
- Computing with Quasiseparable Matrices
- Matrix multiplication over word-size modular rings using approximate formulae
- Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination
- Private Multi-party Matrix Multiplication and Trust Computations
- Computing the rank profile matrix
- 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
- Essentially optimal interactive certificates in linear algebra
- Parallel computation of echelon forms
- Elements of Design for Containers and Solutions in the LinBox Library
- Simultaneous computation of the row and column rank profiles
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Computational linear algebra over finite fields
- Matrix Powers algorithms for trust evaluation in public-key infrastructures
- Rank properties of subspaces of symmetric and hermitian matrices over finite fields
- Subspaces of matrices with special rank properties
- LinBox founding scope allocation, parallel building blocks, and template separate compilation
- Efficient Decomposition of Dense Matrices over GF(2)
- Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures
- Fast computation of Hermite normal forms of random integer matrices
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- On finding multiplicities of characteristic polynomial factors of black-box matrices
- Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
- Faster algorithms for the characteristic polynomial
- Compressed Modular Matrix Multiplication
- Bounds on the coefficients of the characteristic and minimal polynomials
- Parallel Computation of the Rank of Large Sparse Matrices from Algebraic K-theory
- Adaptive Triangular System Solving
- An introspective algorithm for the integer determinant
- Adaptive and Hybrid Algorithms: classification and illustration on triangular system solving
- Towards a diagrammatic modeling of the LinBox C++ linear algebra library
- Efficient Computation of the Characteristic Polynomial
- FFPACK: finite field linear algebra package
- Efficient dot product over finite fields
- FFLAS: Finite field linear algebra subroutines
- Parallel block algorithms for exact triangularizations
- Computing the rank of large sparse matrices over finite fields
- LinBox: A Generic Library for Exact Linear Algebra
- On efficient sparse integer matrix Smith normal form computations
- A new parallel algorithm for exact triangularization of rectangular matrices
- Smith form via the Valence : Experience with matrices from homology

Last modified: Thu May 7 11:30:26 CEST 2020