2079 search results - page 34 / 416 » Universality of random graphs |
110
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
123
click to vote
ALENEX
2010
15 years 3 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
138
click to vote
AML
1999
15 years 1 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
123
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...