Sciweavers

16 search results - page 4 / 4
» An Improved Succinct Representation for Dynamic k-ary Trees
Sort
View
USITS
2003
13 years 5 months 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...