2079 search results - page 156 / 416 » Universality of random graphs |
209
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
182
click to vote
STOC
2004
ACM
15 years 12 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
167
click to vote
CRYPTO
2005
Springer
16 years 1 days ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
173
click to vote
JAL
2002
15 years 6 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
169
click to vote
ICNP
2005
IEEE
16 years 3 days ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...