247
click to vote
FSTTCS
16 years 23 days ago
2004 Springer 
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
237
click to vote
FSTTCS
16 years 23 days ago
2004 Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
221
click to vote
FSTTCS
16 years 23 days ago
2004 Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
216
click to vote
FSTTCS
16 years 23 days ago
2004 Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
207
click to vote
FSTTCS
16 years 23 days ago
2004 Springer
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...
|
Software Engineering