The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
In the context of ambient networks, this article describes a cryptographic protocol called Common History Extraction (CHE) protocol implementing a trust management framework. All t...
Samuel Galice, Marine Minier, John Mullins, St&eac...
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...