SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
CCGRID
2010
IEEE
13 years 7 months ago
2010
IEEE
In order to address the high performance I/O needs of HPC and enterprise applications, modern interconnection fabrics, such as InfiniBand and more recently, 10GigE, rely on network...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
PODC
2010
ACM
13 years 7 months ago
2010
ACM
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
PODC
2010
ACM
13 years 7 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
CCGRID
2010
IEEE
13 years 7 months ago
2010
IEEE
