Sciweavers

103 search results - page 3 / 21
» The Cover Time of Random Digraphs
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Expander Properties and the Cover Time of Random Intersection Graphs
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
ICALP
2005
Springer
14 years 1 months ago
On the Cover Time of Random Geometric Graphs
Chen Avin, Gunes Ercal
COCOON
2010
Springer
13 years 10 months ago
The Cover Time of Deterministic Random Walks
Tobias Friedrich, Thomas Sauerwald
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
14 years 1 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
EUROCRYPT
2005
Springer
14 years 1 months ago
Predicting and Distinguishing Attacks on RC4 Keystream Generator
In this paper we analyze the statistical distribution of the keystream generator used by the stream ciphers RC4 and RC4A. Our first result is the discovery of statistical biases o...
Itsik Mantin