15 search results - page 2 / 3 » siamcomp 2002 |
SIAMCOMP
2002
13 years 5 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
SIAMCOMP
2002
13 years 5 months ago
2002
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
SIAMCOMP
2002
13 years 5 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
SIAMCOMP
2002
13 years 5 months ago
2002
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...