Loose coupling is a common way of organizing collaboration in work groups, but it has not been studied extensively in CSCW. In this paper, we consider the patterns of work that ar...
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
Li Ou, Xubin He, Christian Engelmann, Stephen L. S...
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Current network protocols must comply with rigid interfaces and rules of behavior to fit into well defined, vertical protocol stacks. It is difficult for network designers to offe...
The emergence of short-range wireless communications hold the promise of realizing the grand vision of the next generation communication networks in which devices follow a always ...