Clément Pernet

Orcid: 0000-0001-6970-0417

According to our database1, Clément Pernet authored at least 58 papers between 2002 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
High-order lifting for polynomial Sylvester matrices.
J. Complex., February, 2024

Computing Krylov iterates in the time of matrix multiplication.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

Strassen's algorithm is not optimally accurate.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability).
Proc. Priv. Enhancing Technol., July, 2023

Some fast algorithms multiplying a matrix by its adjoint.
J. Symb. Comput., 2023

Exact computations with quasiseparable matrices.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021
Verification protocols with sub-linear communication for polynomial matrix operations.
J. Symb. Comput., 2021

Deterministic computation of the characteristic polynomial in the time of matrix multiplication.
J. Complex., 2021

VESPo: Verified Evaluation of Secret Polynomials.
CoRR, 2021

Dynamic proofs of retrievability with low server storage.
Proceedings of the 30th USENIX Security Symposium, 2021

Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices.
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.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Elimination-based certificates for triangular equivalence and rank profiles.
J. Symb. Comput., 2020

On fast multiplication of a matrix by its transpose.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Hermite Rational Function Interpolation with Error Correction.
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.
SIAM J. Matrix Anal. Appl., 2019

Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm.
Proceedings of the Advances in Information and Computer Security, 2019

LU Factorization with Errors.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Poster: Proofs of Retrievability with Low Server Storage.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Time and space efficient generators for quasiseparable matrices.
J. Symb. Comput., 2018

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication.
CoRR, 2018

Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix.
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.
J. Symb. Comput., 2017

Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Certificates for Triangular Equivalence and Rank Profiles.
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.
Parallel Comput., 2016

Computing with Quasiseparable Matrices.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Exact Linear Algebra Algorithmic: Theory and Practice.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Computing the Rank Profile Matrix.
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.
CoRR, 2014

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

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance.
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

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

2013
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition.
J. Symb. Comput., 2013

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

Computational linear algebra over finite fields.
Proceedings of the Handbook of Finite Fields., 2013

2012
On the decoding of quasi-BCH codes
CoRR, 2012

Computational linear algebra over finite fields
CoRR, 2012

Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements
CoRR, 2011

2010
Efficient Decomposition of Dense Matrices over GF(2)
CoRR, 2010

Output-sensitive decoding for redundant residue systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation.
Proceedings of the Mathematical Software, 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

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

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

Faster algorithms for the characteristic polynomial.
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).
PhD thesis, 2006

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

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

2005
Computing the Kalman form
CoRR, 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
LU based algorithms for characteristic polynomial over a finite field.
SIGSAM Bull., 2003

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


  Loading...