2252 search results - page 139 / 451 » Lower Bounds for Dynamic Algorithms |
135
click to vote
JACM
2002
15 years 3 months ago
2002
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
111
Voted
ICDCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
100
Voted
ALT
2008
Springer
16 years 10 days ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
140
Voted
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...