Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...