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...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
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...
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...
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...
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...