2084 search results - page 116 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
112
Voted
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
63
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
130
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
120
Voted
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
138
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...