Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
This paper proposes an open, extensible control plane for a global event service, based on semantically rich messages. This is based on the novel application of control plane separ...
David Lewis, John Keeney, Declan O'Sullivan, Song ...
We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive f...
Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shac...
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...