Clément Pernet

Hippolyte Signargout

J. Complex., February, 2024

Computing Krylov iterates in the time of matrix multiplication.

[BibT_eX]

[DOI]

Vincent Neiger

CoRR, 2024

Strassen's algorithm is not optimally accurate.

[BibT_eX]

[DOI]

Alexandre Sedoglavic

CoRR, 2024

2023

VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability).

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., July, 2023

Some fast algorithms multiplying a matrix by its adjoint.

[BibT_eX]

[DOI]

Alexandre Sedoglavic

J. Symb. Comput., 2023

Exact computations with quasiseparable matrices.

[BibT_eX]

[DOI]

Hippolyte Signargout

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

2021

Verification protocols with sub-linear communication for polynomial matrix operations.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Deterministic computation of the characteristic polynomial in the time of matrix multiplication.

[BibT_eX]

[DOI]

Vincent Neiger

J. Complex., 2021

VESPo: Verified Evaluation of Secret Polynomials.

[BibT_eX]

[DOI]

CoRR, 2021

Dynamic proofs of retrievability with low server storage.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate.

[BibT_eX]

[DOI]

Zhi-Hong Yang

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Elimination-based certificates for triangular equivalence and rank profiles.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

On fast multiplication of a matrix by its transpose.

[BibT_eX]

[DOI]

Alexandre Sedoglavic

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Hermite Rational Function Interpolation with Error Correction.

[BibT_eX]

[DOI]

Zhi-Hong Yang

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019

Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic.

[BibT_eX]

[DOI]

Claude-Pierre Jeannerod

Théo Mary

Daniel S. Roche

SIAM J. Matrix Anal. Appl., 2019

Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2019

LU Factorization with Errors.

[BibT_eX]

[DOI]

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

Poster: Proofs of Retrievability with Low Server Storage.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Time and space efficient generators for quasiseparable matrices.

[BibT_eX]

[DOI]

Arne Storjohann

J. Symb. Comput., 2018

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication.

[BibT_eX]

[DOI]

CoRR, 2018

Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

Fast computation of the rank profile matrix and the generalized Bruhat decomposition.

[BibT_eX]

[DOI]

Ziad Sultan

J. Symb. Comput., 2017

Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Certificates for Triangular Equivalence and Rank Profiles.

[BibT_eX]

[DOI]

David Lucas

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination.

[BibT_eX]

[DOI]

Parallel Comput., 2016

Computing with Quasiseparable Matrices.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

Exact Linear Algebra Algorithmic: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 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

Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance.

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance.

[BibT_eX]

[DOI]

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

High Performance and Reliable Algebraic Computing. (Calcul Algébrique Fiable et Haute Performance).

[BibT_eX]

[DOI]

, 2014

2013

Rank-profile revealing Gaussian elimination and the CUP matrix decomposition.

[BibT_eX]

[DOI]

Claude-Pierre Jeannerod

Arne Storjohann

J. Symb. Comput., 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

On the decoding of quasi-BCH codes

[BibT_eX]

[DOI]

Morgan Barbier

Guillaume Quintin

CoRR, 2012

Computational linear algebra over finite fields

[BibT_eX]

[DOI]

CoRR, 2012

Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values.

[BibT_eX]

[DOI]

Matthew T. Comer

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

2011

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

[BibT_eX]

[DOI]

Martin R. Albrecht

Gregory V. Bard

CoRR, 2011

2010

Efficient Decomposition of Dense Matrices over GF(2)

[BibT_eX]

[DOI]

Martin R. Albrecht

CoRR, 2010

Output-sensitive decoding for redundant residue systems.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software, 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

2008

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

[BibT_eX]

[DOI]

Pascal Giorgi

ACM Trans. Math. Softw., 2008

2007

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

[BibT_eX]

[DOI]

Wei Zhou

CoRR, 2007

Faster algorithms for the characteristic polynomial.

[BibT_eX]

[DOI]

Arne Storjohann

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

2006

Algèbre linéaire exacte efficace : le calcul du polynôme caractéristique. (Efficient exact linear algebra: computing the characteristic polynomial).

[BibT_eX]

[DOI]

PhD thesis, 2006

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

[BibT_eX]

[DOI]

CoRR, 2006

Adaptive Triangular System Solving.

[BibT_eX]

[DOI]

Jean-Louis Roch

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

2005

Computing the Kalman form

[BibT_eX]

[DOI]

Aude Rondepierre

CoRR, 2005

Efficient computation of the characteristic polynomial.

[BibT_eX]

[DOI]

Zhendong Wan

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

FFPACK: finite field linear algebra package.

[BibT_eX]

[DOI]

Pascal Giorgi

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

LU based algorithms for characteristic polynomial over a finite field.

[BibT_eX]

[DOI]

Zhendong Wan

SIGSAM Bull., 2003

2002

Finite field linear algebra subroutines.

[BibT_eX]

[DOI]

Thierry Gautier