7773 search results - page 406 / 1555 » On generalized Frame-Stewart numbers |
180
click to vote
EUROCRYPT
2004
Springer
16 years 5 days ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
207
click to vote
GG
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
181
click to vote
SETN
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
167
click to vote
STACS
2004
Springer
16 years 3 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
235
click to vote
VIZSEC
2004
Springer
16 years 3 days ago
2004
Springer
The number of attacks against large computer systems is currently growing at a rapid pace. Despite the best efforts of security analysts, large organizations are having trouble k...