120 search results - page 17 / 24 » siamcomp 2008 |
SIAMCOMP
2002
14 years 11 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...
128
click to vote
SIAMCOMP
2002
14 years 11 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...
108
click to vote
SIAMCOMP
2002
14 years 11 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
14 years 11 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...
76
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...