Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
Many situations present a social choice problem where different self-interested agents have to agree on joint, coordinated decisions. For example, power companies have to agree o...