2084 search results - page 101 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
98
Voted
WDAG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated dat...
196
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
127
Voted
DCG
2008
15 years 2 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
134
click to vote
JPDC
2007
15 years 2 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
133
Voted
IPTPS
2003
Springer
15 years 7 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...