A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...