1612 search results - page 183 / 323 » Analysing Randomized Distributed Algorithms |
138
click to vote
PODC
2003
ACM
15 years 7 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
101
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
115
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
145
Voted
WDAG
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
117
Voted
SIGSOFT
2003
ACM
16 years 3 months ago
2003
ACM
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...