FSTTCS
14 years 3 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...
FSTTCS
14 years 3 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...
FSTTCS
14 years 3 months ago
2004 Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
FSTTCS
14 years 3 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...
FSTTCS
14 years 3 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, ...
|
Software Engineering