154 search results - page 10 / 31 » rsa 2006 |
RSA
2008
14 years 11 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
RSA
2010
14 years 10 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
RSA
1998
14 years 11 months ago
1998
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approxim...
ASIACRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
106
click to vote
RSA
2006
14 years 11 months ago
2006
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...