2084 search results - page 283 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
158
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...