default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Pernet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Clément Pernet, Hippolyte Signargout, Gilles Villard:
High-order lifting for polynomial Sylvester matrices. J. Complex. 80: 101803 (2024)- [c30]Jean-Guillaume Dumas
, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. ISSAC 2024: 254-263 - [c29]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. ISSAC 2024: 419-428 - [i34]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. CoRR abs/2402.05630 (2024) - [i33]Vincent Neiger, Clément Pernet, Gilles Villard:
Computing Krylov iterates in the time of matrix multiplication. CoRR abs/2402.07345 (2024) - 2023
- [j12]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. J. Symb. Comput. 115: 285-315 (2023) - [j11]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. 2023(3): 354-374 (2023) - [c28]Clément Pernet, Hippolyte Signargout, Gilles Villard:
Exact computations with quasiseparable matrices. ISSAC 2023: 480-489 - [i32]Clément Pernet, Hippolyte Signargout, Gilles Villard:
Exact computations with quasiseparable matrices. CoRR abs/2302.04515 (2023) - 2021
- [j10]Vincent Neiger, Clément Pernet:
Deterministic computation of the characteristic polynomial in the time of matrix multiplication. J. Complex. 67: 101572 (2021) - [j9]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Verification protocols with sub-linear communication for polynomial matrix operations. J. Symb. Comput. 105: 165-198 (2021) - [c27]Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang:
Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. ISSAC 2021: 241-247 - [c26]Pierre Karpman, Clément Pernet, Hippolyte Signargout, Gilles Villard:
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. ISSAC 2021: 249-256 - [c25]Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. USENIX Security Symposium 2021: 537-554 - [i31]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. CoRR abs/2101.01025 (2021) - [i30]Clément Pernet, Hippolyte Signargout, Pierre Karpman, Gilles Villard:
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. CoRR abs/2104.02497 (2021) - [i29]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials. CoRR abs/2110.02022 (2021) - 2020
- [j8]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. J. Symb. Comput. 98: 246-269 (2020) - [c24]Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang:
Hermite Rational Function Interpolation with Error Correction. CASC 2020: 335-357 - [c23]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. ISSAC 2020: 162-169 - [i28]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. CoRR abs/2001.04109 (2020) - [i27]Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. CoRR abs/2007.12556 (2020) - [i26]Vincent Neiger, Clément Pernet:
Deterministic computation of the characteristic polynomial in the time of matrix multiplication. CoRR abs/2010.04662 (2020)
2010 – 2019
- 2019
- [j7]Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche:
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. 40(4): 1478-1496 (2019) - [c22]Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
Poster: Proofs of Retrievability with Low Server Storage. CCS 2019: 2601-2603 - [c21]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU Factorization with Errors. ISSAC 2019: 131-138 - [c20]Jean-Guillaume Dumas, Pascal Lafourcade, Julio López Fenner, David Lucas, Jean-Baptiste Orfila, Clément Pernet, Maxime Puys:
Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm. IWSEC 2019: 67-88 - [i25]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU factorization with errors. CoRR abs/1901.10730 (2019) - [i24]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. CoRR abs/1909.05692 (2019) - 2018
- [j6]Clément Pernet, Arne Storjohann:
Time and space efficient generators for quasiseparable matrices. J. Symb. Comput. 85: 224-246 (2018) - [c19]Jean-Guillaume Dumas, Clément Pernet:
Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix. ISSAC 2018: 151-158 - [i23]Jean-Guillaume Dumas, Clément Pernet:
Symmetric indefinite triangular factorization revealing the rank profile matrix. CoRR abs/1802.10453 (2018) - [i22]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. CoRR abs/1807.01272 (2018) - 2017
- [j5]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Fast computation of the rank profile matrix and the generalized Bruhat decomposition. J. Symb. Comput. 83: 187-210 (2017) - [c18]Jean-Guillaume Dumas, David Lucas, Clément Pernet:
Certificates for Triangular Equivalence and Rank Profiles. ISSAC 2017: 133-140 - [c17]Erich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell:
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. ISSAC 2017: 237-244 - [i21]Clément Pernet, Arne Storjohann:
Time and space efficient generators for quasiseparable matrices. CoRR abs/1701.00396 (2017) - [i20]Jean-Guillaume Dumas, David Lucas, Clément Pernet:
Certificates for triangular equivalence and rank profiles. CoRR abs/1702.03755 (2017) - 2016
- [j4]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Jean-Louis Roch, Ziad Sultan:
Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination. Parallel Comput. 57: 235-249 (2016) - [c16]Clément Pernet:
Computing with Quasiseparable Matrices. ISSAC 2016: 389-396 - [i19]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition. CoRR abs/1601.01798 (2016) - [i18]Clément Pernet:
Computing with quasiseparable matrices. CoRR abs/1602.01246 (2016) - 2015
- [c15]Clément Pernet:
Exact Linear Algebra Algorithmic: Theory and Practice. ISSAC 2015: 17-18 - [c14]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Computing the Rank Profile Matrix. ISSAC 2015: 149-156 - [e1]Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet:
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015. ACM 2015, ISBN 978-1-4503-3599-7 [contents] - [i17]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Computing the Rank Profile Matrix. CoRR abs/1501.05239 (2015) - 2014
- [b2]Clément Pernet:
High Performance and Reliable Algebraic Computing. (Calcul Algébrique Fiable et Haute Performance). Joseph Fourier University, Grenoble, France, 2014 - [c13]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan:
Parallel Computation of Echelon Forms. Euro-Par 2014: 499-510 - [c12]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. ICMS 2014: 654-662 - [c11]Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. ISSAC 2014: 272-279 - [i16]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan:
Parallel computation of echelon forms. CoRR abs/1402.3501 (2014) - [i15]Erich L. Kaltofen, Clément Pernet:
Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. CoRR abs/1403.3594 (2014) - [i14]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library. CoRR abs/1407.3262 (2014) - 2013
- [j3]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. J. Symb. Comput. 56: 46-68 (2013) - [c10]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Simultaneous computation of the row and column rank profiles. ISSAC 2013: 181-188 - [p1]Jean-Guillaume Dumas, Clément Pernet:
Computational linear algebra over finite fields. Handbook of Finite Fields 2013: 520-534 - [i13]Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Simultaneous computation of the row and column rank profiles. CoRR abs/1301.4438 (2013) - 2012
- [c9]Matthew T. Comer, Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. ISSAC 2012: 138-145 - [i12]Jean-Guillaume Dumas, Clément Pernet:
Computational linear algebra over finite fields. CoRR abs/1204.3735 (2012) - [i11]Morgan Barbier, Clément Pernet, Guillaume Quintin:
On the decoding of quasi-BCH codes. CoRR abs/1212.5663 (2012) - 2011
- [i10]Martin R. Albrecht, Gregory V. Bard, Clément Pernet:
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements. CoRR abs/1111.6549 (2011) - [i9]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. CoRR abs/1112.5717 (2011) - 2010
- [c8]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. ICMS 2010: 77-83 - [c7]Majid Khonji, Clément Pernet, Jean-Louis Roch, Thomas Roche, Thomas Stalinski:
Output-sensitive decoding for redundant residue systems. ISSAC 2010: 265-272 - [i8]Martin R. Albrecht, Clément Pernet:
Efficient Decomposition of Dense Matrices over GF(2). CoRR abs/1006.1744 (2010) - [i7]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox founding scope allocation, parallel building blocks, and separate compilation. CoRR abs/1009.1317 (2010)
2000 – 2009
- 2009
- [c6]Brice Boyer, Jean-Guillaume Dumas, Clément Pernet, Wei Zhou:
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. ISSAC 2009: 55-62 - [c5]Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009: 135-142 - [i6]Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices. CoRR abs/0901.4747 (2009) - 2008
- [j2]Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet:
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages. ACM Trans. Math. Softw. 35(3): 19:1-19:42 (2008) - 2007
- [c4]Clément Pernet, Arne Storjohann:
Faster algorithms for the characteristic polynomial. ISSAC 2007: 307-314 - [i5]Jean-Guillaume Dumas, Clément Pernet, Wei Zhou:
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. CoRR abs/0707.2347 (2007) - 2006
- [b1]Clément Pernet:
Algèbre linéaire exacte efficace : le calcul du polynôme caractéristique. (Efficient exact linear algebra: computing the characteristic polynomial). Joseph Fourier University, Grenoble, France, 2006 - [i4]Jean-Guillaume Dumas, Clément Pernet, Jean-Louis Roch:
Adaptive Triangular System Solving. Challenges in Symbolic Computation Software 2006 - [i3]Jean-Guillaume Dumas, Thierry Gautier, Pascal Giorgi, Clément Pernet:
Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages. CoRR abs/cs/0601133 (2006) - 2005
- [c3]Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan:
Efficient computation of the characteristic polynomial. ISSAC 2005: 140-147 - [i2]Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan:
Efficient Computation of the Characteristic Polynomial. CoRR abs/cs/0501074 (2005) - [i1]Clément Pernet, Aude Rondepierre, Gilles Villard:
Computing the Kalman form. CoRR abs/cs/0510014 (2005) - 2004
- [c2]Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet:
FFPACK: finite field linear algebra package. ISSAC 2004: 119-126 - 2003
- [j1]Clément Pernet, Zhendong Wan:
LU based algorithms for characteristic polynomial over a finite field. SIGSAM Bull. 37(3): 83-84 (2003) - 2002
- [c1]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet:
Finite field linear algebra subroutines. ISSAC 2002: 63-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
