194
click to vote
FSTTCS
15 years 10 months 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...
174
click to vote
FSTTCS
15 years 10 months 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, ...
160
click to vote
FSTTCS
15 years 10 months ago
2004 Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
159
click to vote
FSTTCS
15 years 10 months 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...
156
click to vote
FSTTCS
15 years 10 months 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