218
Voted
FSTTCS
16 years 2 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...
204
click to vote
FSTTCS
16 years 2 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, ...
188
click to vote
FSTTCS
16 years 2 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...
187
Voted
FSTTCS
16 years 2 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...
187
click to vote
FSTTCS
16 years 2 days ago
2004 Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
|
Software Engineering