Quasi-separable matrices are a class of rank-structured matriceswidely u...
We consider the problem of efficiently evaluating a secret polynomial at...
New algorithms are presented for computing annihilating polynomials of
T...
We present a non-commutative algorithm for the multiplication of a 2 x 2...
This paper describes an algorithm which computes the characteristic
poly...
Proofs of Retrievability (PoRs) are protocols which allow a client to st...
We present a non-commutative algorithm for the multiplication of a
2x2-b...
In this paper, we give novel certificates for triangular equivalence and...
We present new algorithms to detect and correct errors in the lower-uppe...
We design and analyze new protocols to verify the correctness of various...
We develop and analyze new protocols to verify the correctness of variou...
We present a novel recursive algorithm for reducing a symmetric matrix t...
In this paper, we give novel certificates for triangular equivalence and...
The class of quasiseparable matrices is defined by the property that any...
The class of quasiseparable matrices is defined by a pair of bounds, cal...
The row (resp. column) rank profile of a matrix describes the stair-case...