We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diï...