320 search results - page 2 / 64 » Rigorous Result for the CHKNS Random Graph Model |
111
click to vote
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
120
click to vote
SIAMDM
2010
14 years 11 months ago
2010
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
101
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
142
click to vote
ACST
2006
15 years 2 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
133
click to vote
RSA
2010
14 years 11 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...