2517 search results - page 424 / 504 » Specifying Weak Sets |
141
Voted
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also kno...
165
click to vote
COMPLIFE
2005
Springer
15 years 11 months ago
2005
Springer
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
160
click to vote
ISNN
2005
Springer
15 years 11 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
139
Voted
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
153
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...