Sciweavers

COMBINATORICS
2004
69views more  COMBINATORICS 2004»
13 years 11 months ago
Convergence in Distribution for Subset Counts Between Random Sets
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
Dudley Stark
USITS
2003
14 years 27 days ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...