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...
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...