2084 search results - page 121 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
174
click to vote
COCOA
2010
Springer
15 years 2 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
123
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
140
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
175
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
115
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...