This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product...
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
In Cator and Lopuha¨a [3] an asymptotic expansion for the MCD estimators is established in a very general framework. This expansion requires the existence and non-singularity of ...