7133 search results - page 406 / 1427 » Communication algorithms with advice |
161
click to vote
PODC
2006
ACM
16 years 23 days ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
164
click to vote
ICCS
2004
Springer
16 years 6 days ago
2004
Springer
We consider the realization of matrix-matrix multiplication and propose a hierarchical algorithm implemented in a task-parallel way using multiprocessor tasks on distributed memory...
158
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
189
click to vote
CODES
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents an enhancement of our "Algorithm Architecture Adequation" (AAA) prototyping methodology which allows to rapidly develop and optimize the implementati...
188
click to vote
ENTCS
2006
15 years 6 months ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...