2084 search results - page 96 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
106
Voted
SPAA
1998
ACM
15 years 6 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
109
click to vote
SSS
2007
Springer
15 years 8 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
99
Voted
SIROCCO
2007
15 years 3 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
132
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
111
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...