A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
To keep the evidence that a stored hard disk does not modify its content, the intuitive scheme is to calculate a hash value of the data in all the sectors in a specific order. Ho...
Zoe L. Jiang, Lucas Chi Kwong Hui, K. P. Chow, Siu...
Large-scale distributed systems present numerous security problems not present in local systems. In this paper we present a general security architecture for a large-scale object-...
Bogdan C. Popescu, Maarten van Steen, Andrew S. Ta...