Sciweavers

Share
9 search results - page 1 / 2
» Randomly colouring graphs (a combinatorial view)
Sort
View
EJC
2008
9 years 9 months ago
Dyck paths with coloured ascents
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...
Andrei Asinowski, Toufik Mansour
TCS
2010
9 years 4 months ago
The relevant prefixes of coloured Motzkin walks: An average case analysis
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...
Donatella Merlini, Renzo Sprugnoli
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
10 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
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...
FCT
2009
Springer
10 years 4 months ago
On Random Betweenness Constraints
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...
Andreas Goerdt
books