2079 search results - page 42 / 416 » Universality of random graphs |
140
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
106
click to vote
CAAN
2004
Springer
15 years 7 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
124
click to vote
CCS
2009
ACM
16 years 2 months ago
2009
ACM
We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by maliciou...
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
D Images at Multiple Abstraction Levels Rodrigo Moreno∗, Miguel Angel Garcia∗∗ and Domenec Puig∗ (∗)Intelligent Robotics and Computer Vision Group, Rovira i Virgili Unive...
137
click to vote
CAV
2006
Springer
15 years 5 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...