735 search results - page 8 / 147 » Randomization in Parallel Stringology |
PODC
1996
ACM
15 years 6 months ago
1996
ACM
PODC
1993
ACM
15 years 5 months ago
1993
ACM
PODC
1994
ACM
15 years 5 months ago
1994
ACM
127
click to vote
JUCS
2008
15 years 1 months ago
2008
: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a part...
111
click to vote
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...